./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety-realloc/array-realloc-2.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/array-memsafety-realloc/array-realloc-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a27e6fc2049c9dc12360bd8cd7682ef33f4a19a5a5a6c0e7a780c3703a0494b5 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 17:18:15,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 17:18:16,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-22 17:18:16,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 17:18:16,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 17:18:16,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 17:18:16,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 17:18:16,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 17:18:16,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 17:18:16,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 17:18:16,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 17:18:16,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 17:18:16,082 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 17:18:16,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 17:18:16,084 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 17:18:16,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 17:18:16,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 17:18:16,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 17:18:16,085 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 17:18:16,085 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 17:18:16,085 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 17:18:16,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 17:18:16,086 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 17:18:16,086 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 17:18:16,086 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 17:18:16,087 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 17:18:16,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 17:18:16,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 17:18:16,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 17:18:16,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 17:18:16,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:18:16,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 17:18:16,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 17:18:16,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 17:18:16,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 17:18:16,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 17:18:16,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 17:18:16,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 17:18:16,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 17:18:16,090 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 -> a27e6fc2049c9dc12360bd8cd7682ef33f4a19a5a5a6c0e7a780c3703a0494b5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 17:18:16,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 17:18:16,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 17:18:16,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 17:18:16,341 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 17:18:16,341 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 17:18:16,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety-realloc/array-realloc-2.i [2023-11-22 17:18:17,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 17:18:17,602 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 17:18:17,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety-realloc/array-realloc-2.i [2023-11-22 17:18:17,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88b048597/774f06c71049439582b193ff212edc74/FLAG419eab3f5 [2023-11-22 17:18:17,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88b048597/774f06c71049439582b193ff212edc74 [2023-11-22 17:18:17,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 17:18:17,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 17:18:17,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 17:18:17,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 17:18:17,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 17:18:17,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:18:17" (1/1) ... [2023-11-22 17:18:17,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ba154d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:17, skipping insertion in model container [2023-11-22 17:18:17,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:18:17" (1/1) ... [2023-11-22 17:18:17,683 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:18:17,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:18:17,920 ERROR L324 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) [2023-11-22 17:18:17,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5996175a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:17, skipping insertion in model container [2023-11-22 17:18:17,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 17:18:17,921 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-22 17:18:17,936 INFO L158 Benchmark]: Toolchain (without parser) took 284.38ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 69.5MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 17:18:17,937 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 17:18:17,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.44ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 69.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 17:18:17,939 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.15ms. Allocated memory is still 155.2MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.44ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 69.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 575]: 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 ../../../trunk/examples/svcomp/array-memsafety-realloc/array-realloc-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a27e6fc2049c9dc12360bd8cd7682ef33f4a19a5a5a6c0e7a780c3703a0494b5 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 17:18:20,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 17:18:20,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-22 17:18:20,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 17:18:20,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 17:18:20,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 17:18:20,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 17:18:20,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 17:18:20,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 17:18:20,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 17:18:20,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 17:18:20,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 17:18:20,113 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 17:18:20,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 17:18:20,115 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 17:18:20,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 17:18:20,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 17:18:20,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 17:18:20,116 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 17:18:20,116 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 17:18:20,116 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 17:18:20,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 17:18:20,117 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 17:18:20,117 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 17:18:20,118 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 17:18:20,118 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 17:18:20,118 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 17:18:20,118 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 17:18:20,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 17:18:20,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 17:18:20,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 17:18:20,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 17:18:20,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:18:20,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 17:18:20,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 17:18:20,121 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 17:18:20,121 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 17:18:20,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 17:18:20,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 17:18:20,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 17:18:20,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 17:18:20,123 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 17:18:20,123 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 -> a27e6fc2049c9dc12360bd8cd7682ef33f4a19a5a5a6c0e7a780c3703a0494b5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 17:18:20,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 17:18:20,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 17:18:20,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 17:18:20,390 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 17:18:20,390 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 17:18:20,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety-realloc/array-realloc-2.i [2023-11-22 17:18:21,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 17:18:21,849 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 17:18:21,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety-realloc/array-realloc-2.i [2023-11-22 17:18:21,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/259d7d1bc/73be0c0d8c334afbaf1c378271ff799e/FLAG4bdbf0059 [2023-11-22 17:18:21,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/259d7d1bc/73be0c0d8c334afbaf1c378271ff799e [2023-11-22 17:18:21,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 17:18:21,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 17:18:21,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 17:18:21,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 17:18:21,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 17:18:21,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:18:21" (1/1) ... [2023-11-22 17:18:21,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a477d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:21, skipping insertion in model container [2023-11-22 17:18:21,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:18:21" (1/1) ... [2023-11-22 17:18:21,915 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:18:22,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:18:22,116 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-22 17:18:22,123 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:18:22,169 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:18:22,176 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 17:18:22,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:18:22,248 INFO L206 MainTranslator]: Completed translation [2023-11-22 17:18:22,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22 WrapperNode [2023-11-22 17:18:22,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 17:18:22,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 17:18:22,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 17:18:22,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 17:18:22,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (1/1) ... [2023-11-22 17:18:22,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (1/1) ... [2023-11-22 17:18:22,304 INFO L138 Inliner]: procedures = 120, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2023-11-22 17:18:22,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 17:18:22,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 17:18:22,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 17:18:22,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 17:18:22,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (1/1) ... [2023-11-22 17:18:22,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (1/1) ... [2023-11-22 17:18:22,322 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (1/1) ... [2023-11-22 17:18:22,332 WARN L107 HeapSplitter]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2023-11-22 17:18:22,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (1/1) ... [2023-11-22 17:18:22,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (1/1) ... [2023-11-22 17:18:22,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (1/1) ... [2023-11-22 17:18:22,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (1/1) ... [2023-11-22 17:18:22,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (1/1) ... [2023-11-22 17:18:22,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (1/1) ... [2023-11-22 17:18:22,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 17:18:22,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 17:18:22,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 17:18:22,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 17:18:22,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (1/1) ... [2023-11-22 17:18:22,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:18:22,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 17:18:22,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 17:18:22,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 17:18:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 17:18:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 17:18:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 17:18:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 17:18:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 17:18:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-22 17:18:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 17:18:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 17:18:22,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 17:18:22,591 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 17:18:22,593 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 17:18:22,819 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 17:18:22,839 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 17:18:22,842 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 17:18:22,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:18:22 BoogieIcfgContainer [2023-11-22 17:18:22,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 17:18:22,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 17:18:22,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 17:18:22,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 17:18:22,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:18:21" (1/3) ... [2023-11-22 17:18:22,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19989fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:18:22, skipping insertion in model container [2023-11-22 17:18:22,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:18:22" (2/3) ... [2023-11-22 17:18:22,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19989fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:18:22, skipping insertion in model container [2023-11-22 17:18:22,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:18:22" (3/3) ... [2023-11-22 17:18:22,852 INFO L112 eAbstractionObserver]: Analyzing ICFG array-realloc-2.i [2023-11-22 17:18:22,865 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 17:18:22,865 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-11-22 17:18:22,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 17:18:22,913 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@44e46862, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 17:18:22,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-11-22 17:18:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 2.111111111111111) internal successors, (38), 32 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) [2023-11-22 17:18:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-22 17:18:22,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:22,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-22 17:18:22,925 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:22,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:22,930 INFO L85 PathProgramCache]: Analyzing trace with hash 96320, now seen corresponding path program 1 times [2023-11-22 17:18:22,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:22,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021116990] [2023-11-22 17:18:22,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:22,940 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 [2023-11-22 17:18:22,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:22,942 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) [2023-11-22 17:18:22,947 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 [2023-11-22 17:18:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:22,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 17:18:22,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:23,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:23,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:23,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021116990] [2023-11-22 17:18:23,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021116990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:23,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:23,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:18:23,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137888613] [2023-11-22 17:18:23,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:23,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:18:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:23,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:18:23,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:18:23,047 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 2.111111111111111) internal successors, (38), 32 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:23,101 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-11-22 17:18:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:18:23,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-11-22 17:18:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:23,110 INFO L225 Difference]: With dead ends: 34 [2023-11-22 17:18:23,110 INFO L226 Difference]: Without dead ends: 32 [2023-11-22 17:18:23,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:18:23,115 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:23,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:18:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-22 17:18:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-22 17:18:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-11-22 17:18:23,147 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 3 [2023-11-22 17:18:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:23,147 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-11-22 17:18:23,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-11-22 17:18:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-22 17:18:23,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:23,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-22 17:18:23,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:23,350 WARN L477 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 [2023-11-22 17:18:23,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:23,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash 96326, now seen corresponding path program 1 times [2023-11-22 17:18:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504058044] [2023-11-22 17:18:23,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:23,353 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 [2023-11-22 17:18:23,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:23,354 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) [2023-11-22 17:18:23,356 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 [2023-11-22 17:18:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:23,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 17:18:23,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:23,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-22 17:18:23,473 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-22 17:18:23,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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-22 17:18:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:23,488 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:23,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:23,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504058044] [2023-11-22 17:18:23,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504058044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:23,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:23,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:18:23,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61784567] [2023-11-22 17:18:23,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:23,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:18:23,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:23,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:18:23,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:18:23,497 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:23,583 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-11-22 17:18:23,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:18:23,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-11-22 17:18:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:23,584 INFO L225 Difference]: With dead ends: 48 [2023-11-22 17:18:23,584 INFO L226 Difference]: Without dead ends: 48 [2023-11-22 17:18:23,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:18:23,585 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:23,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-22 17:18:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2023-11-22 17:18:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 40 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) [2023-11-22 17:18:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-11-22 17:18:23,590 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 3 [2023-11-22 17:18:23,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:23,590 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-11-22 17:18:23,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2023-11-22 17:18:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-22 17:18:23,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:23,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-22 17:18:23,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:23,793 WARN L477 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 [2023-11-22 17:18:23,794 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:23,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:23,794 INFO L85 PathProgramCache]: Analyzing trace with hash 96327, now seen corresponding path program 1 times [2023-11-22 17:18:23,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:23,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554283994] [2023-11-22 17:18:23,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:23,795 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 [2023-11-22 17:18:23,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:23,796 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) [2023-11-22 17:18:23,799 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 [2023-11-22 17:18:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:23,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 17:18:23,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:23,874 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-11-22 17:18:23,875 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 1 case distinctions, treesize of input 13 treesize of output 15 [2023-11-22 17:18:23,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-22 17:18:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:23,914 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:23,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:23,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554283994] [2023-11-22 17:18:23,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554283994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:23,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:23,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:18:23,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766128771] [2023-11-22 17:18:23,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:23,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:18:23,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:23,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:18:23,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:18:23,917 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:23,999 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2023-11-22 17:18:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:18:24,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-11-22 17:18:24,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:24,002 INFO L225 Difference]: With dead ends: 54 [2023-11-22 17:18:24,002 INFO L226 Difference]: Without dead ends: 54 [2023-11-22 17:18:24,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:18:24,003 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:24,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:24,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-22 17:18:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2023-11-22 17:18:24,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.8125) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2023-11-22 17:18:24,007 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 3 [2023-11-22 17:18:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:24,007 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2023-11-22 17:18:24,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2023-11-22 17:18:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-22 17:18:24,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:24,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-22 17:18:24,026 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 [2023-11-22 17:18:24,211 WARN L477 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 [2023-11-22 17:18:24,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:24,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:24,217 INFO L85 PathProgramCache]: Analyzing trace with hash 92568793, now seen corresponding path program 1 times [2023-11-22 17:18:24,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212415764] [2023-11-22 17:18:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:24,220 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 [2023-11-22 17:18:24,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:24,230 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) [2023-11-22 17:18:24,232 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 [2023-11-22 17:18:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:24,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 17:18:24,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:24,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-22 17:18:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:24,347 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:24,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:24,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212415764] [2023-11-22 17:18:24,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212415764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:24,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:18:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947698197] [2023-11-22 17:18:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:24,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:18:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:24,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:18:24,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:18:24,350 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 4 states, 4 states have (on average 1.25) 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) [2023-11-22 17:18:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:24,444 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2023-11-22 17:18:24,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:18:24,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) 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 [2023-11-22 17:18:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:24,445 INFO L225 Difference]: With dead ends: 62 [2023-11-22 17:18:24,446 INFO L226 Difference]: Without dead ends: 62 [2023-11-22 17:18:24,446 INFO L412 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 [2023-11-22 17:18:24,446 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:24,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 78 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-22 17:18:24,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2023-11-22 17:18:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.78125) internal successors, (57), 43 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2023-11-22 17:18:24,450 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 5 [2023-11-22 17:18:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:24,450 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2023-11-22 17:18:24,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) 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) [2023-11-22 17:18:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2023-11-22 17:18:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-22 17:18:24,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:24,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-22 17:18:24,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:24,652 WARN L477 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 [2023-11-22 17:18:24,653 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:24,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1425334036, now seen corresponding path program 1 times [2023-11-22 17:18:24,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:24,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637764156] [2023-11-22 17:18:24,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:24,654 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 [2023-11-22 17:18:24,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:24,675 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) [2023-11-22 17:18:24,676 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 [2023-11-22 17:18:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:24,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 17:18:24,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:24,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:24,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:24,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637764156] [2023-11-22 17:18:24,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637764156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:24,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:24,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:18:24,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888400837] [2023-11-22 17:18:24,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:24,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:18:24,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:24,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:18:24,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:18:24,749 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:24,861 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2023-11-22 17:18:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:18:24,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-22 17:18:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:24,864 INFO L225 Difference]: With dead ends: 56 [2023-11-22 17:18:24,864 INFO L226 Difference]: Without dead ends: 56 [2023-11-22 17:18:24,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:18:24,865 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:24,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 47 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-22 17:18:24,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2023-11-22 17:18:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2023-11-22 17:18:24,868 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 6 [2023-11-22 17:18:24,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:24,869 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2023-11-22 17:18:24,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2023-11-22 17:18:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-22 17:18:24,869 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:24,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-22 17:18:24,886 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 (6)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:25,073 WARN L477 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 [2023-11-22 17:18:25,074 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:25,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1425334035, now seen corresponding path program 1 times [2023-11-22 17:18:25,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:25,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726186146] [2023-11-22 17:18:25,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:25,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 [2023-11-22 17:18:25,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:25,078 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) [2023-11-22 17:18:25,079 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 [2023-11-22 17:18:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:25,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 17:18:25,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:25,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:25,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:25,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726186146] [2023-11-22 17:18:25,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726186146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:25,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:25,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:18:25,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734239053] [2023-11-22 17:18:25,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:25,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:18:25,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:25,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:18:25,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:18:25,171 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:25,257 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2023-11-22 17:18:25,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:18:25,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-22 17:18:25,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:25,281 INFO L225 Difference]: With dead ends: 49 [2023-11-22 17:18:25,281 INFO L226 Difference]: Without dead ends: 49 [2023-11-22 17:18:25,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:18:25,282 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 49 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:25,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 45 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-22 17:18:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2023-11-22 17:18:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 47 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2023-11-22 17:18:25,285 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 6 [2023-11-22 17:18:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:25,285 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2023-11-22 17:18:25,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2023-11-22 17:18:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 17:18:25,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:25,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:25,330 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 (7)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:25,491 WARN L477 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 [2023-11-22 17:18:25,491 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:25,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2080597039, now seen corresponding path program 1 times [2023-11-22 17:18:25,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:25,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740420771] [2023-11-22 17:18:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:25,493 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 [2023-11-22 17:18:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:25,494 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) [2023-11-22 17:18:25,495 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 [2023-11-22 17:18:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:25,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 17:18:25,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:25,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:25,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:25,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740420771] [2023-11-22 17:18:25,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740420771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:25,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:25,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:18:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108763012] [2023-11-22 17:18:25,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:25,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:18:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:25,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:18:25,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:18:25,626 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:25,706 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2023-11-22 17:18:25,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:18:25,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-22 17:18:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:25,707 INFO L225 Difference]: With dead ends: 62 [2023-11-22 17:18:25,707 INFO L226 Difference]: Without dead ends: 62 [2023-11-22 17:18:25,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:18:25,708 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:25,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 69 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-22 17:18:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2023-11-22 17:18:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 53 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2023-11-22 17:18:25,711 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 9 [2023-11-22 17:18:25,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:25,711 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2023-11-22 17:18:25,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2023-11-22 17:18:25,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 17:18:25,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:25,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:25,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-22 17:18:25,912 WARN L477 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 [2023-11-22 17:18:25,912 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:25,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:25,913 INFO L85 PathProgramCache]: Analyzing trace with hash -73998678, now seen corresponding path program 1 times [2023-11-22 17:18:25,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:25,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103325902] [2023-11-22 17:18:25,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:25,914 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 [2023-11-22 17:18:25,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:25,917 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) [2023-11-22 17:18:25,918 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 [2023-11-22 17:18:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:25,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 17:18:25,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:26,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-22 17:18:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:26,043 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:26,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:26,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103325902] [2023-11-22 17:18:26,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103325902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:26,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:26,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:18:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754507803] [2023-11-22 17:18:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:26,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:18:26,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:26,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:18:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:18:26,045 INFO L87 Difference]: Start difference. First operand 54 states and 72 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) [2023-11-22 17:18:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:26,184 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2023-11-22 17:18:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:18:26,185 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 [2023-11-22 17:18:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:26,185 INFO L225 Difference]: With dead ends: 61 [2023-11-22 17:18:26,186 INFO L226 Difference]: Without dead ends: 61 [2023-11-22 17:18:26,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:18:26,186 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:26,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 62 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-22 17:18:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2023-11-22 17:18:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 54 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2023-11-22 17:18:26,192 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 10 [2023-11-22 17:18:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:26,192 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2023-11-22 17:18:26,192 INFO L496 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) [2023-11-22 17:18:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2023-11-22 17:18:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 17:18:26,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:26,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:26,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:26,395 WARN L477 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 [2023-11-22 17:18:26,395 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:26,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:26,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2609542, now seen corresponding path program 1 times [2023-11-22 17:18:26,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:26,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987057840] [2023-11-22 17:18:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:26,396 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 [2023-11-22 17:18:26,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:26,398 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) [2023-11-22 17:18:26,399 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 [2023-11-22 17:18:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:26,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 17:18:26,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:26,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 17:18:26,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:18:26,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-22 17:18:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:26,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:26,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987057840] [2023-11-22 17:18:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987057840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:26,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:26,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:18:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97946542] [2023-11-22 17:18:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:26,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:18:26,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:26,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:18:26,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:18:26,482 INFO L87 Difference]: Start difference. First operand 55 states and 73 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) [2023-11-22 17:18:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:26,541 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2023-11-22 17:18:26,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:18:26,542 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 [2023-11-22 17:18:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:26,542 INFO L225 Difference]: With dead ends: 60 [2023-11-22 17:18:26,542 INFO L226 Difference]: Without dead ends: 60 [2023-11-22 17:18:26,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:18:26,543 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 47 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 [2023-11-22 17:18:26,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 47 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-22 17:18:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2023-11-22 17:18:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 53 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2023-11-22 17:18:26,546 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 10 [2023-11-22 17:18:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:26,546 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2023-11-22 17:18:26,546 INFO L496 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) [2023-11-22 17:18:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2023-11-22 17:18:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 17:18:26,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:26,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:26,567 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 [2023-11-22 17:18:26,752 WARN L477 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 [2023-11-22 17:18:26,752 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:26,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2609541, now seen corresponding path program 1 times [2023-11-22 17:18:26,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:26,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442484409] [2023-11-22 17:18:26,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:26,754 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 [2023-11-22 17:18:26,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:26,757 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) [2023-11-22 17:18:26,759 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 [2023-11-22 17:18:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:26,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-22 17:18:26,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:26,869 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 [2023-11-22 17:18:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:26,913 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:26,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:26,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442484409] [2023-11-22 17:18:26,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442484409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:26,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:26,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 17:18:26,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797437888] [2023-11-22 17:18:26,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:26,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 17:18:26,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:26,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 17:18:26,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:18:26,914 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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) [2023-11-22 17:18:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:27,018 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2023-11-22 17:18:27,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 17:18:27,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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 [2023-11-22 17:18:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:27,019 INFO L225 Difference]: With dead ends: 87 [2023-11-22 17:18:27,019 INFO L226 Difference]: Without dead ends: 87 [2023-11-22 17:18:27,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-22 17:18:27,020 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 58 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:27,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 78 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-22 17:18:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 58. [2023-11-22 17:18:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.5625) internal successors, (75), 57 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2023-11-22 17:18:27,024 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 10 [2023-11-22 17:18:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:27,024 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2023-11-22 17:18:27,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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) [2023-11-22 17:18:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2023-11-22 17:18:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 17:18:27,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:27,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:27,032 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 [2023-11-22 17:18:27,228 WARN L477 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 [2023-11-22 17:18:27,228 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:27,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:27,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2001008371, now seen corresponding path program 1 times [2023-11-22 17:18:27,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:27,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728833637] [2023-11-22 17:18:27,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:27,229 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 [2023-11-22 17:18:27,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:27,230 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) [2023-11-22 17:18:27,232 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 [2023-11-22 17:18:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:27,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 17:18:27,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:27,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-22 17:18:27,302 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 10 treesize of output 11 [2023-11-22 17:18:27,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-22 17:18:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:27,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:27,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:27,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728833637] [2023-11-22 17:18:27,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728833637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:27,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:27,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:18:27,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117397785] [2023-11-22 17:18:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:27,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:18:27,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:27,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:18:27,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:18:27,342 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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) [2023-11-22 17:18:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:27,435 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2023-11-22 17:18:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:18:27,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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 [2023-11-22 17:18:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:27,436 INFO L225 Difference]: With dead ends: 60 [2023-11-22 17:18:27,436 INFO L226 Difference]: Without dead ends: 60 [2023-11-22 17:18:27,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:18:27,437 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:27,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 53 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-22 17:18:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2023-11-22 17:18:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 58 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) [2023-11-22 17:18:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2023-11-22 17:18:27,446 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 11 [2023-11-22 17:18:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:27,446 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2023-11-22 17:18:27,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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) [2023-11-22 17:18:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2023-11-22 17:18:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 17:18:27,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:27,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:27,451 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 (12)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:27,649 WARN L477 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 [2023-11-22 17:18:27,650 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:27,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash -80895790, now seen corresponding path program 1 times [2023-11-22 17:18:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:27,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559165863] [2023-11-22 17:18:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:27,651 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 [2023-11-22 17:18:27,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:27,652 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) [2023-11-22 17:18:27,653 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 [2023-11-22 17:18:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:27,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-22 17:18:27,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:27,756 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2023-11-22 17:18:27,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 19 [2023-11-22 17:18:27,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-22 17:18:27,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-11-22 17:18:27,835 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-22 17:18:27,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-11-22 17:18:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:27,895 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:27,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:27,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559165863] [2023-11-22 17:18:27,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559165863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:27,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:27,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 17:18:27,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969306338] [2023-11-22 17:18:27,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:27,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 17:18:27,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:27,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 17:18:27,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:18:27,897 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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) [2023-11-22 17:18:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:28,159 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2023-11-22 17:18:28,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 17:18:28,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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 [2023-11-22 17:18:28,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:28,160 INFO L225 Difference]: With dead ends: 70 [2023-11-22 17:18:28,160 INFO L226 Difference]: Without dead ends: 70 [2023-11-22 17:18:28,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-11-22 17:18:28,160 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:28,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 80 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:18:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-22 17:18:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2023-11-22 17:18:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 58 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) [2023-11-22 17:18:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2023-11-22 17:18:28,163 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 11 [2023-11-22 17:18:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:28,163 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2023-11-22 17:18:28,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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) [2023-11-22 17:18:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2023-11-22 17:18:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 17:18:28,163 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:28,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:28,178 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 [2023-11-22 17:18:28,367 WARN L477 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 [2023-11-22 17:18:28,367 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:28,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:28,368 INFO L85 PathProgramCache]: Analyzing trace with hash -80895789, now seen corresponding path program 1 times [2023-11-22 17:18:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313516481] [2023-11-22 17:18:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:28,369 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 [2023-11-22 17:18:28,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:28,370 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) [2023-11-22 17:18:28,394 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 [2023-11-22 17:18:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:28,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-22 17:18:28,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:28,495 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-22 17:18:28,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-11-22 17:18:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:28,557 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:28,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:28,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313516481] [2023-11-22 17:18:28,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313516481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:28,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:28,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 17:18:28,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482883402] [2023-11-22 17:18:28,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:28,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 17:18:28,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:28,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 17:18:28,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:18:28,558 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) [2023-11-22 17:18:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:28,737 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2023-11-22 17:18:28,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 17:18:28,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 [2023-11-22 17:18:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:28,739 INFO L225 Difference]: With dead ends: 71 [2023-11-22 17:18:28,739 INFO L226 Difference]: Without dead ends: 71 [2023-11-22 17:18:28,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-11-22 17:18:28,739 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 70 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:28,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 71 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-22 17:18:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2023-11-22 17:18:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 64 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2023-11-22 17:18:28,742 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 11 [2023-11-22 17:18:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:28,742 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2023-11-22 17:18:28,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) [2023-11-22 17:18:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2023-11-22 17:18:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 17:18:28,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:28,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:28,746 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 [2023-11-22 17:18:28,943 WARN L477 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 [2023-11-22 17:18:28,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:28,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:28,943 INFO L85 PathProgramCache]: Analyzing trace with hash -80887624, now seen corresponding path program 1 times [2023-11-22 17:18:28,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:28,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012324872] [2023-11-22 17:18:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:28,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 [2023-11-22 17:18:28,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:28,944 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) [2023-11-22 17:18:28,947 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 [2023-11-22 17:18:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:29,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 17:18:29,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:29,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:29,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:29,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012324872] [2023-11-22 17:18:29,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012324872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:29,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:29,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:18:29,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619921465] [2023-11-22 17:18:29,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:29,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:18:29,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:29,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:18:29,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:18:29,011 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2023-11-22 17:18:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:29,042 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2023-11-22 17:18:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:18:29,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 [2023-11-22 17:18:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:29,043 INFO L225 Difference]: With dead ends: 65 [2023-11-22 17:18:29,043 INFO L226 Difference]: Without dead ends: 65 [2023-11-22 17:18:29,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:18:29,044 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 27 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:29,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 69 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:18:29,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-22 17:18:29,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2023-11-22 17:18:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 62 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) [2023-11-22 17:18:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2023-11-22 17:18:29,046 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 11 [2023-11-22 17:18:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:29,046 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2023-11-22 17:18:29,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2023-11-22 17:18:29,047 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2023-11-22 17:18:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-22 17:18:29,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:29,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:29,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:29,267 WARN L477 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 [2023-11-22 17:18:29,268 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:29,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1901717453, now seen corresponding path program 1 times [2023-11-22 17:18:29,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:29,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121564604] [2023-11-22 17:18:29,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:29,269 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 [2023-11-22 17:18:29,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:29,270 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) [2023-11-22 17:18:29,271 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 [2023-11-22 17:18:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:29,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 17:18:29,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:29,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:18:29,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:29,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121564604] [2023-11-22 17:18:29,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121564604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:18:29,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:18:29,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:18:29,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893382931] [2023-11-22 17:18:29,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:18:29,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:18:29,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:29,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:18:29,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:18:29,350 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:29,372 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2023-11-22 17:18:29,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:18:29,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-22 17:18:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:29,374 INFO L225 Difference]: With dead ends: 57 [2023-11-22 17:18:29,374 INFO L226 Difference]: Without dead ends: 57 [2023-11-22 17:18:29,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:18:29,374 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:29,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 44 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:18:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-22 17:18:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-22 17:18:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 56 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) [2023-11-22 17:18:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2023-11-22 17:18:29,376 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 12 [2023-11-22 17:18:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:29,377 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2023-11-22 17:18:29,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2023-11-22 17:18:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-22 17:18:29,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:29,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:29,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-22 17:18:29,580 WARN L477 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 [2023-11-22 17:18:29,580 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:29,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2021803022, now seen corresponding path program 1 times [2023-11-22 17:18:29,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:29,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887912137] [2023-11-22 17:18:29,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:29,581 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 [2023-11-22 17:18:29,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:29,582 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) [2023-11-22 17:18:29,583 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 [2023-11-22 17:18:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:29,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 17:18:29,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:29,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:18:29,679 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-22 17:18:29,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-22 17:18:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:29,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:29,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887912137] [2023-11-22 17:18:29,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887912137] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:18:29,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:18:29,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2023-11-22 17:18:29,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986608917] [2023-11-22 17:18:29,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:18:29,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:18:29,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:29,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:18:29,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:18:29,692 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:29,745 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2023-11-22 17:18:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:18:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-22 17:18:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:29,746 INFO L225 Difference]: With dead ends: 58 [2023-11-22 17:18:29,746 INFO L226 Difference]: Without dead ends: 58 [2023-11-22 17:18:29,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:18:29,746 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 25 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.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:29,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 25 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:18:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-22 17:18:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2023-11-22 17:18:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2023-11-22 17:18:29,748 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 15 [2023-11-22 17:18:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:29,748 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2023-11-22 17:18:29,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2023-11-22 17:18:29,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-22 17:18:29,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:29,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:29,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:29,948 WARN L477 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 [2023-11-22 17:18:29,949 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:29,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:29,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2021803023, now seen corresponding path program 1 times [2023-11-22 17:18:29,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:29,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963255963] [2023-11-22 17:18:29,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:29,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:18:29,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:29,950 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) [2023-11-22 17:18:29,952 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 [2023-11-22 17:18:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:30,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 17:18:30,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:30,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:18:30,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 17:18:30,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2023-11-22 17:18:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:30,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963255963] [2023-11-22 17:18:30,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963255963] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:18:30,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:18:30,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-11-22 17:18:30,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787221010] [2023-11-22 17:18:30,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:18:30,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 17:18:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:30,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 17:18:30,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:18:30,241 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 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) [2023-11-22 17:18:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:30,302 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-11-22 17:18:30,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:18:30,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 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 [2023-11-22 17:18:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:30,303 INFO L225 Difference]: With dead ends: 38 [2023-11-22 17:18:30,303 INFO L226 Difference]: Without dead ends: 38 [2023-11-22 17:18:30,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-22 17:18:30,303 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:30,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 32 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 17:18:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-22 17:18:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-11-22 17:18:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.3793103448275863) 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) [2023-11-22 17:18:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-22 17:18:30,304 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 15 [2023-11-22 17:18:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:30,305 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-22 17:18:30,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 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) [2023-11-22 17:18:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-22 17:18:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-22 17:18:30,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:30,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:30,322 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 [2023-11-22 17:18:30,505 WARN L477 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 [2023-11-22 17:18:30,506 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:30,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1748615731, now seen corresponding path program 1 times [2023-11-22 17:18:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:30,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008205977] [2023-11-22 17:18:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:30,507 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 [2023-11-22 17:18:30,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:30,508 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) [2023-11-22 17:18:30,524 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 [2023-11-22 17:18:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:30,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-22 17:18:30,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:30,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 17:18:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:30,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:18:30,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-22 17:18:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:30,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:30,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008205977] [2023-11-22 17:18:30,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008205977] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:18:30,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:18:30,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-11-22 17:18:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016687110] [2023-11-22 17:18:30,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:18:30,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 17:18:30,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:30,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 17:18:30,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:18:30,721 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:30,854 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2023-11-22 17:18:30,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 17:18:30,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-22 17:18:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:30,854 INFO L225 Difference]: With dead ends: 39 [2023-11-22 17:18:30,855 INFO L226 Difference]: Without dead ends: 39 [2023-11-22 17:18:30,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-22 17:18:30,855 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:30,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 38 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-22 17:18:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-11-22 17:18:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3448275862068966) 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) [2023-11-22 17:18:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-22 17:18:30,856 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 16 [2023-11-22 17:18:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:30,856 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-22 17:18:30,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:30,857 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-22 17:18:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 17:18:30,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:30,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:30,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:31,057 WARN L477 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 [2023-11-22 17:18:31,057 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:31,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:31,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1627487278, now seen corresponding path program 1 times [2023-11-22 17:18:31,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:31,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390516578] [2023-11-22 17:18:31,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:31,058 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 [2023-11-22 17:18:31,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:31,073 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) [2023-11-22 17:18:31,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-22 17:18:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:31,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-22 17:18:31,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:31,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-22 17:18:31,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 17:18:31,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 17:18:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:31,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:18:31,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-22 17:18:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:31,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:31,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390516578] [2023-11-22 17:18:31,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390516578] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:18:31,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:18:31,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2023-11-22 17:18:31,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364859743] [2023-11-22 17:18:31,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:18:31,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 17:18:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:31,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 17:18:31,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-11-22 17:18:31,524 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:31,933 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2023-11-22 17:18:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 17:18:31,934 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-22 17:18:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:31,934 INFO L225 Difference]: With dead ends: 38 [2023-11-22 17:18:31,934 INFO L226 Difference]: Without dead ends: 38 [2023-11-22 17:18:31,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2023-11-22 17:18:31,935 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 49 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:31,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 33 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 17:18:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-22 17:18:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2023-11-22 17:18:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 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) [2023-11-22 17:18:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-11-22 17:18:31,936 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2023-11-22 17:18:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:31,936 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-11-22 17:18:31,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-11-22 17:18:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 17:18:31,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:31,937 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:31,945 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 [2023-11-22 17:18:32,137 WARN L477 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 [2023-11-22 17:18:32,138 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:32,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1698876415, now seen corresponding path program 1 times [2023-11-22 17:18:32,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:32,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90330204] [2023-11-22 17:18:32,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:32,139 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 [2023-11-22 17:18:32,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:32,139 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) [2023-11-22 17:18:32,186 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 [2023-11-22 17:18:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:32,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 17:18:32,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:32,278 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 [2023-11-22 17:18:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:32,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:18:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:32,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:32,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90330204] [2023-11-22 17:18:32,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90330204] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:18:32,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:18:32,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-11-22 17:18:32,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636251435] [2023-11-22 17:18:32,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:18:32,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 17:18:32,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:32,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 17:18:32,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-22 17:18:32,510 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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) [2023-11-22 17:18:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:33,652 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2023-11-22 17:18:33,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-22 17:18:33,653 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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 17 [2023-11-22 17:18:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:33,654 INFO L225 Difference]: With dead ends: 132 [2023-11-22 17:18:33,654 INFO L226 Difference]: Without dead ends: 132 [2023-11-22 17:18:33,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2023-11-22 17:18:33,654 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 239 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:33,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 129 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 17:18:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-22 17:18:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 76. [2023-11-22 17:18:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 75 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2023-11-22 17:18:33,656 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 17 [2023-11-22 17:18:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:33,657 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2023-11-22 17:18:33,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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) [2023-11-22 17:18:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2023-11-22 17:18:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 17:18:33,657 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:33,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:33,675 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 [2023-11-22 17:18:33,860 WARN L477 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 [2023-11-22 17:18:33,861 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:33,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:33,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1087501841, now seen corresponding path program 1 times [2023-11-22 17:18:33,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:33,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91198598] [2023-11-22 17:18:33,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:33,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 [2023-11-22 17:18:33,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:33,863 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) [2023-11-22 17:18:33,863 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 [2023-11-22 17:18:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:33,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 17:18:33,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:33,956 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 [2023-11-22 17:18:33,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:18:33,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-22 17:18:34,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 17:18:34,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-22 17:18:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:34,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:18:34,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-11-22 17:18:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:34,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:34,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91198598] [2023-11-22 17:18:34,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91198598] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:18:34,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:18:34,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-11-22 17:18:34,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797929260] [2023-11-22 17:18:34,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:18:34,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 17:18:34,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:34,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 17:18:34,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-22 17:18:34,166 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:34,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:34,340 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2023-11-22 17:18:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 17:18:34,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 [2023-11-22 17:18:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:34,341 INFO L225 Difference]: With dead ends: 79 [2023-11-22 17:18:34,341 INFO L226 Difference]: Without dead ends: 79 [2023-11-22 17:18:34,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-22 17:18:34,342 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:34,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 27 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:18:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-22 17:18:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2023-11-22 17:18:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.352112676056338) internal successors, (96), 74 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2023-11-22 17:18:34,344 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 18 [2023-11-22 17:18:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:34,344 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2023-11-22 17:18:34,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2023-11-22 17:18:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 17:18:34,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:34,345 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:34,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:34,547 WARN L477 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 [2023-11-22 17:18:34,548 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:34,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1125561294, now seen corresponding path program 1 times [2023-11-22 17:18:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:34,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988437940] [2023-11-22 17:18:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:34,548 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 [2023-11-22 17:18:34,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:34,550 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) [2023-11-22 17:18:34,581 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 [2023-11-22 17:18:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:34,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-22 17:18:34,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:34,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 17:18:34,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 17:18:34,819 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-22 17:18:34,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-22 17:18:34,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:18:34,845 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-22 17:18:34,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-11-22 17:18:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:35,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:18:35,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107 [2023-11-22 17:18:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:35,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:35,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988437940] [2023-11-22 17:18:35,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988437940] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:18:35,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:18:35,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-11-22 17:18:35,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141964582] [2023-11-22 17:18:35,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:18:35,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-22 17:18:35,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:35,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-22 17:18:35,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-11-22 17:18:35,269 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:37,397 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2023-11-22 17:18:37,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 17:18:37,398 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-22 17:18:37,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:37,398 INFO L225 Difference]: With dead ends: 82 [2023-11-22 17:18:37,398 INFO L226 Difference]: Without dead ends: 82 [2023-11-22 17:18:37,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2023-11-22 17:18:37,399 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 88 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:37,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 53 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 17:18:37,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-22 17:18:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2023-11-22 17:18:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2023-11-22 17:18:37,401 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 18 [2023-11-22 17:18:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:37,401 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2023-11-22 17:18:37,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2023-11-22 17:18:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 17:18:37,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:37,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:37,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:37,601 WARN L477 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 [2023-11-22 17:18:37,602 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:37,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:37,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1125561295, now seen corresponding path program 1 times [2023-11-22 17:18:37,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:37,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905106202] [2023-11-22 17:18:37,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:37,603 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 [2023-11-22 17:18:37,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:37,604 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) [2023-11-22 17:18:37,607 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 [2023-11-22 17:18:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:37,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 17:18:37,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:37,830 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-22 17:18:37,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-11-22 17:18:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:37,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:18:38,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-11-22 17:18:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:38,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:18:38,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905106202] [2023-11-22 17:18:38,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905106202] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:18:38,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:18:38,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2023-11-22 17:18:38,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75463313] [2023-11-22 17:18:38,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:18:38,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-22 17:18:38,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:18:38,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-22 17:18:38,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-11-22 17:18:38,157 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:18:39,214 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2023-11-22 17:18:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-22 17:18:39,215 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-22 17:18:39,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:18:39,215 INFO L225 Difference]: With dead ends: 67 [2023-11-22 17:18:39,215 INFO L226 Difference]: Without dead ends: 67 [2023-11-22 17:18:39,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=729, Unknown=0, NotChecked=0, Total=992 [2023-11-22 17:18:39,216 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 171 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 17:18:39,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 65 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 17:18:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-22 17:18:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2023-11-22 17:18:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2023-11-22 17:18:39,218 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 18 [2023-11-22 17:18:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:18:39,218 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2023-11-22 17:18:39,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:18:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2023-11-22 17:18:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 17:18:39,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:18:39,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:18:39,231 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 (24)] Forceful destruction successful, exit code 0 [2023-11-22 17:18:39,418 WARN L477 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 [2023-11-22 17:18:39,419 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:18:39,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:18:39,419 INFO L85 PathProgramCache]: Analyzing trace with hash 647181393, now seen corresponding path program 1 times [2023-11-22 17:18:39,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:18:39,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814752816] [2023-11-22 17:18:39,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:18:39,420 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 [2023-11-22 17:18:39,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:18:39,421 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) [2023-11-22 17:18:39,421 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 [2023-11-22 17:18:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:18:39,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-22 17:18:39,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:18:39,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 50 [2023-11-22 17:18:40,406 WARN L876 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base|)) (= |c_ULTIMATE.start_main_~#a~0#1.base| |c_ULTIMATE.start_expandArray_~pointer#1.base|) (= |c_ULTIMATE.start_expandArray_~pointer#1.offset| |c_ULTIMATE.start_main_~#a~0#1.offset|) (let ((.cse0 (= |c_ULTIMATE.start_main_~#a~0#1.base| |c_ULTIMATE.start_expandArray_~temp~0#1.base|)) (.cse2 (select |c_#valid| |c_ULTIMATE.start_expandArray_~temp~0#1.base|))) (or (and .cse0 (exists ((|ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 1)) (v_DerPreprocessor_2 (_ BitVec 1))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| v_DerPreprocessor_2))) (and (= (_ bv0 1) (select (store .cse1 |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 1)) |c_ULTIMATE.start_expandArray_~temp~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base|)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| (select (store .cse1 |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#a~0#1.base|)) |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 1)) |c_ULTIMATE.start_expandArray_~temp~0#1.base| .cse2)))))) (exists ((v_ArrVal_478 (_ BitVec 1)) (|ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ BitVec 32))) (let ((.cse3 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 1)))) (and (= (select .cse3 |c_ULTIMATE.start_expandArray_~temp~0#1.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_478) |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base|)) (= |c_#valid| (store .cse3 |c_ULTIMATE.start_expandArray_~temp~0#1.base| .cse2))))) (and (not .cse0) (exists ((|ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 1))) (let ((.cse5 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#a~0#1.base|)))) (let ((.cse4 (store .cse5 |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 1)))) (and (= (_ bv0 1) (select .cse4 |c_ULTIMATE.start_expandArray_~temp~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base|)) (= |c_#valid| (store .cse4 |c_ULTIMATE.start_expandArray_~temp~0#1.base| .cse2)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| (select (store .cse5 |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#a~0#1.base|)) |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base|) (_ bv0 1)))))))))) is different from true [2023-11-22 17:18:40,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 17:18:40,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 50 [2023-11-22 17:18:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:18:40,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:18:41,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2023-11-22 17:18:56,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-22 17:19:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:19:12,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:19:12,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814752816] [2023-11-22 17:19:12,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814752816] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:19:12,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:19:12,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-22 17:19:12,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031420267] [2023-11-22 17:19:12,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:19:12,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-22 17:19:12,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:19:12,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-22 17:19:12,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=188, Unknown=13, NotChecked=28, Total=272 [2023-11-22 17:19:12,564 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 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) [2023-11-22 17:19:14,280 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#a~0#1.base|)))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base|)) (= |c_ULTIMATE.start_main_~#a~0#1.base| |c_ULTIMATE.start_expandArray_~pointer#1.base|) (= |c_ULTIMATE.start_expandArray_~pointer#1.offset| |c_ULTIMATE.start_main_~#a~0#1.offset|) (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~#a~0#1.base| |c_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|))) (or (and (exists ((|ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 1)) (v_DerPreprocessor_2 (_ BitVec 1))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| v_DerPreprocessor_2))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 1)) |c_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base| .cse0)) (= (select (store .cse1 |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 1)) |c_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|) (_ bv0 1)) (not (= |c_ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base|)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| (select (store .cse1 |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#a~0#1.base|)) |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base|))))) .cse2) (exists ((v_ArrVal_478 (_ BitVec 1)) (|ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ BitVec 32))) (let ((.cse3 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 1)))) (and (= |c_#valid| (store .cse3 |c_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base| .cse0)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_478) |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base|)) (= (select .cse3 |c_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|) (_ bv0 1))))) (and (exists ((|ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 1))) (let ((.cse4 (store .cse5 |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 1)))) (and (= (_ bv0 1) (select .cse4 |c_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base|)) (= (store .cse4 |c_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base| .cse0) |c_#valid|) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| (select (store .cse5 |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#a~0#1.base|)) |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base|) (_ bv0 1))))) (not .cse2)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#a~0#1.base|) |c_ULTIMATE.start_main_~#a~0#1.offset|))) (let ((.cse7 (select |c_#valid| .cse6))) (or (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| .cse6 .cse7)) (exists ((v_ArrVal_478 (_ BitVec 1))) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_478) .cse6)))) (and (= |c_#valid| (store .cse5 .cse6 .cse7)) (not (= |c_ULTIMATE.start_main_~#a~0#1.base| .cse6)) (= (_ bv0 1) (select .cse5 .cse6)))))))) is different from true [2023-11-22 17:19:14,362 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#a~0#1.base|))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#a~0#1.base|) |c_ULTIMATE.start_main_~#a~0#1.offset|))) (and (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| .cse0 (_ bv0 1)) |c_ULTIMATE.start_main_~#a~0#1.base| (_ bv0 1))) (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_main_#t~mem8#1.base|))) (or (and (not (= |c_ULTIMATE.start_main_~#a~0#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base|)) (= (store .cse1 |c_ULTIMATE.start_main_#t~mem8#1.base| .cse2) |c_#valid|) (= (_ bv0 1) (select .cse1 |c_ULTIMATE.start_main_#t~mem8#1.base|))) (and (exists ((v_ArrVal_478 (_ BitVec 1))) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_main_#t~mem8#1.base|))) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_#t~mem8#1.base| .cse2))))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base|)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_#t~mem8#1.base| (_ bv0 1)) |c_ULTIMATE.start_main_~#a~0#1.base| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|) (let ((.cse3 (select |c_#valid| .cse0))) (or (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| .cse0 .cse3)) (exists ((v_ArrVal_478 (_ BitVec 1))) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_478) .cse0)))) (and (= |c_#valid| (store .cse1 .cse0 .cse3)) (not (= |c_ULTIMATE.start_main_~#a~0#1.base| .cse0)) (= (_ bv0 1) (select .cse1 .cse0))))))) is different from true [2023-11-22 17:19:14,370 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_main_#t~mem8#1.base|))) (or (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#a~0#1.base|)))) (and (not (= |c_ULTIMATE.start_main_~#a~0#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base|)) (= (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| .cse1) |c_#valid|) (= (_ bv0 1) (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|)))) (and (exists ((v_ArrVal_478 (_ BitVec 1))) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_main_#t~mem8#1.base|))) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_#t~mem8#1.base| .cse1))))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#a~0#1.base|)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_#t~mem8#1.base| (_ bv0 1)) |c_ULTIMATE.start_main_~#a~0#1.base| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from true [2023-11-22 17:19:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:19:15,221 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2023-11-22 17:19:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 17:19:15,222 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 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) Word has length 19 [2023-11-22 17:19:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:19:15,223 INFO L225 Difference]: With dead ends: 104 [2023-11-22 17:19:15,223 INFO L226 Difference]: Without dead ends: 97 [2023-11-22 17:19:15,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=16, NotChecked=148, Total=506 [2023-11-22 17:19:15,224 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-22 17:19:15,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 60 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 99 Unchecked, 1.5s Time] [2023-11-22 17:19:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-22 17:19:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2023-11-22 17:19:15,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 94 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2023-11-22 17:19:15,226 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 19 [2023-11-22 17:19:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:19:15,226 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2023-11-22 17:19:15,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 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) [2023-11-22 17:19:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2023-11-22 17:19:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 17:19:15,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:19:15,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:19:15,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-11-22 17:19:15,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:19:15,434 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:19:15,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:19:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1233987407, now seen corresponding path program 1 times [2023-11-22 17:19:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:19:15,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104588294] [2023-11-22 17:19:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:19:15,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:19:15,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:19:15,436 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:19:15,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-22 17:19:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:19:15,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 17:19:15,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:19:15,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-22 17:19:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:19:15,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:19:15,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:19:15,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104588294] [2023-11-22 17:19:15,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104588294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:19:15,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:19:15,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 17:19:15,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609860275] [2023-11-22 17:19:15,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:19:15,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:19:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:19:15,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:19:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:19:15,580 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:19:15,664 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2023-11-22 17:19:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:19:15,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-22 17:19:15,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:19:15,665 INFO L225 Difference]: With dead ends: 88 [2023-11-22 17:19:15,665 INFO L226 Difference]: Without dead ends: 88 [2023-11-22 17:19:15,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:19:15,666 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:19:15,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 53 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:19:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-22 17:19:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-22 17:19:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 85 states have (on average 1.2) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2023-11-22 17:19:15,668 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 19 [2023-11-22 17:19:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:19:15,668 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2023-11-22 17:19:15,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2023-11-22 17:19:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 17:19:15,669 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:19:15,669 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:19:15,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-11-22 17:19:15,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:19:15,870 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:19:15,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:19:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1537310283, now seen corresponding path program 1 times [2023-11-22 17:19:15,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:19:15,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968687283] [2023-11-22 17:19:15,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:19:15,871 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 [2023-11-22 17:19:15,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:19:15,872 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:19:15,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-22 17:19:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:19:15,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 17:19:15,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:19:15,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 17:19:16,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-22 17:19:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:19:16,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:19:16,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:19:16,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968687283] [2023-11-22 17:19:16,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968687283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:19:16,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:19:16,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 17:19:16,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174091528] [2023-11-22 17:19:16,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:19:16,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:19:16,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:19:16,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:19:16,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:19:16,012 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:19:16,097 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2023-11-22 17:19:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 17:19:16,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-11-22 17:19:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:19:16,098 INFO L225 Difference]: With dead ends: 48 [2023-11-22 17:19:16,098 INFO L226 Difference]: Without dead ends: 48 [2023-11-22 17:19:16,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:19:16,098 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:19:16,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:19:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-22 17:19:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-22 17:19:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2023-11-22 17:19:16,100 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 26 [2023-11-22 17:19:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:19:16,100 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2023-11-22 17:19:16,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2023-11-22 17:19:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 17:19:16,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:19:16,101 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2023-11-22 17:19:16,104 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 (27)] Forceful destruction successful, exit code 0 [2023-11-22 17:19:16,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:19:16,302 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:19:16,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:19:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1449919743, now seen corresponding path program 2 times [2023-11-22 17:19:16,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:19:16,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900711012] [2023-11-22 17:19:16,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 17:19:16,305 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 [2023-11-22 17:19:16,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:19:16,306 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:19:16,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-22 17:19:16,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 17:19:16,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:19:16,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-22 17:19:16,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:19:16,640 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 [2023-11-22 17:19:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:19:16,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:19:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:19:17,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:19:17,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900711012] [2023-11-22 17:19:17,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900711012] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:19:17,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:19:17,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-11-22 17:19:17,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661515720] [2023-11-22 17:19:17,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:19:17,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-22 17:19:17,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:19:17,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-22 17:19:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2023-11-22 17:19:17,307 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 22 states, 21 states have (on average 4.142857142857143) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:19:22,844 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2023-11-22 17:19:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-11-22 17:19:22,845 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.142857142857143) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 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 45 [2023-11-22 17:19:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:19:22,845 INFO L225 Difference]: With dead ends: 113 [2023-11-22 17:19:22,845 INFO L226 Difference]: Without dead ends: 113 [2023-11-22 17:19:22,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1357, Invalid=4495, Unknown=0, NotChecked=0, Total=5852 [2023-11-22 17:19:22,847 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 167 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:19:22,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 24 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-22 17:19:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-22 17:19:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2023-11-22 17:19:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 102 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2023-11-22 17:19:22,849 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 45 [2023-11-22 17:19:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:19:22,849 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2023-11-22 17:19:22,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.142857142857143) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2023-11-22 17:19:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-22 17:19:22,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:19:22,849 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1] [2023-11-22 17:19:22,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-11-22 17:19:23,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:19:23,053 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:19:23,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:19:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1997839055, now seen corresponding path program 2 times [2023-11-22 17:19:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:19:23,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309276631] [2023-11-22 17:19:23,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 17:19:23,054 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 [2023-11-22 17:19:23,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:19:23,055 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:19:23,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-11-22 17:19:23,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-22 17:19:23,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:19:23,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 17:19:23,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:19:23,259 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 17:19:23,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-22 17:19:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-22 17:19:23,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:19:23,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:19:23,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309276631] [2023-11-22 17:19:23,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309276631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:19:23,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:19:23,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 17:19:23,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751440331] [2023-11-22 17:19:23,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:19:23,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 17:19:23,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:19:23,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 17:19:23,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:19:23,391 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:19:23,753 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2023-11-22 17:19:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 17:19:23,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-11-22 17:19:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:19:23,754 INFO L225 Difference]: With dead ends: 102 [2023-11-22 17:19:23,754 INFO L226 Difference]: Without dead ends: 102 [2023-11-22 17:19:23,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2023-11-22 17:19:23,758 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 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 [2023-11-22 17:19:23,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:19:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-22 17:19:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-22 17:19:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.00990099009901) internal successors, (102), 101 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2023-11-22 17:19:23,761 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 46 [2023-11-22 17:19:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:19:23,761 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2023-11-22 17:19:23,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2023-11-22 17:19:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-22 17:19:23,762 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:19:23,762 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1] [2023-11-22 17:19:23,765 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 (29)] Forceful destruction successful, exit code 0 [2023-11-22 17:19:23,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:19:23,965 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:19:23,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:19:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2111834369, now seen corresponding path program 3 times [2023-11-22 17:19:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:19:23,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207919055] [2023-11-22 17:19:23,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 17:19:23,966 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 [2023-11-22 17:19:23,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:19:23,967 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:19:23,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-22 17:19:26,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-11-22 17:19:26,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:19:26,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-22 17:19:26,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:19:26,320 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 [2023-11-22 17:19:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:19:26,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:19:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:19:28,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:19:28,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207919055] [2023-11-22 17:19:28,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207919055] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:19:28,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:19:28,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2023-11-22 17:19:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167937397] [2023-11-22 17:19:28,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:19:28,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-22 17:19:28,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:19:28,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-22 17:19:28,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2023-11-22 17:19:28,232 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand has 38 states, 37 states have (on average 5.378378378378378) internal successors, (199), 38 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:19:57,136 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2023-11-22 17:19:57,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2023-11-22 17:19:57,137 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 5.378378378378378) internal successors, (199), 38 states have internal predecessors, (199), 0 states have call successors, (0), 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 101 [2023-11-22 17:19:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:19:57,138 INFO L225 Difference]: With dead ends: 216 [2023-11-22 17:19:57,138 INFO L226 Difference]: Without dead ends: 216 [2023-11-22 17:19:57,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9888 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=5977, Invalid=21083, Unknown=0, NotChecked=0, Total=27060 [2023-11-22 17:19:57,142 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 246 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-22 17:19:57,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 32 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1810 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-11-22 17:19:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-22 17:19:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2023-11-22 17:19:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.0046948356807512) internal successors, (214), 213 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2023-11-22 17:19:57,152 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 101 [2023-11-22 17:19:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:19:57,152 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2023-11-22 17:19:57,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 5.378378378378378) internal successors, (199), 38 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:19:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2023-11-22 17:19:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-22 17:19:57,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:19:57,154 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 30, 30, 29, 29, 1, 1, 1, 1, 1] [2023-11-22 17:19:57,166 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 (30)] Forceful destruction successful, exit code 0 [2023-11-22 17:19:57,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:19:57,366 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:19:57,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:19:57,366 INFO L85 PathProgramCache]: Analyzing trace with hash 504224511, now seen corresponding path program 4 times [2023-11-22 17:19:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:19:57,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871534482] [2023-11-22 17:19:57,367 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 17:19:57,367 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 [2023-11-22 17:19:57,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:19:57,368 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2023-11-22 17:19:57,369 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 (31)] Waiting until timeout for monitored process [2023-11-22 17:19:58,920 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 17:19:58,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:19:58,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 1957 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-22 17:19:58,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:19:59,724 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 [2023-11-22 17:19:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3016 backedges. 0 proven. 3016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:19:59,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:20:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3016 backedges. 0 proven. 3016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:20:05,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:20:05,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871534482] [2023-11-22 17:20:05,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871534482] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:20:05,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:20:05,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2023-11-22 17:20:05,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845229464] [2023-11-22 17:20:05,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:20:05,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-11-22 17:20:05,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:20:05,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-11-22 17:20:05,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1197, Invalid=3633, Unknown=0, NotChecked=0, Total=4830 [2023-11-22 17:20:05,490 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand has 70 states, 69 states have (on average 6.130434782608695) internal successors, (423), 70 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:22:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:22:27,756 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2023-11-22 17:22:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 309 states. [2023-11-22 17:22:27,757 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 6.130434782608695) internal successors, (423), 70 states have internal predecessors, (423), 0 states have call successors, (0), 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 213 [2023-11-22 17:22:27,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:22:27,759 INFO L225 Difference]: With dead ends: 440 [2023-11-22 17:22:27,759 INFO L226 Difference]: Without dead ends: 440 [2023-11-22 17:22:27,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44208 ImplicationChecksByTransitivity, 134.3s TimeCoverageRelationStatistics Valid=25009, Invalid=90931, Unknown=0, NotChecked=0, Total=115940 [2023-11-22 17:22:27,772 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 545 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 7758 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 7767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 7758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:22:27,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 62 Invalid, 7767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 7758 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2023-11-22 17:22:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2023-11-22 17:22:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2023-11-22 17:22:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 1.002288329519451) internal successors, (438), 437 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:22:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 438 transitions. [2023-11-22 17:22:27,780 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 438 transitions. Word has length 213 [2023-11-22 17:22:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:22:27,780 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 438 transitions. [2023-11-22 17:22:27,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 6.130434782608695) internal successors, (423), 70 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:22:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 438 transitions. [2023-11-22 17:22:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2023-11-22 17:22:27,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:22:27,784 INFO L195 NwaCegarLoop]: trace histogram [62, 62, 62, 62, 62, 61, 61, 1, 1, 1, 1, 1] [2023-11-22 17:22:27,808 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 (31)] Forceful destruction successful, exit code 0 [2023-11-22 17:22:27,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:22:27,999 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-22 17:22:27,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:22:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1610719999, now seen corresponding path program 5 times [2023-11-22 17:22:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:22:28,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891535217] [2023-11-22 17:22:28,001 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-22 17:22:28,001 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 [2023-11-22 17:22:28,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:22:28,003 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2023-11-22 17:22:28,024 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 (32)] Waiting until timeout for monitored process Killed by 15