./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56160afe0156ee9cb1db810e306de9e54e614e31d545b68546457414a273604d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:44:17,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:44:17,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:44:17,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:44:17,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:44:17,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:44:17,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:44:17,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:44:17,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:44:17,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:44:17,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:44:17,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:44:17,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:44:17,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:44:17,899 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:44:17,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:44:17,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:44:17,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:44:17,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:44:17,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:44:17,903 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:44:17,904 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:44:17,904 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:44:17,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:44:17,904 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:44:17,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:44:17,905 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:44:17,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:44:17,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:44:17,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:44:17,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:44:17,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:44:17,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:44:17,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:44:17,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:44:17,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:44:17,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:44:17,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:44:17,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:44:17,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:44:17,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:44:17,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:44:17,908 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 -> 56160afe0156ee9cb1db810e306de9e54e614e31d545b68546457414a273604d [2024-10-14 17:44:18,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:44:18,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:44:18,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:44:18,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:44:18,132 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:44:18,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i [2024-10-14 17:44:19,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:44:19,589 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:44:19,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i [2024-10-14 17:44:19,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6e59cd8/9485c2568d3d4c018e50a0a21d0a0ebb/FLAG662785f35 [2024-10-14 17:44:19,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6e59cd8/9485c2568d3d4c018e50a0a21d0a0ebb [2024-10-14 17:44:19,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:44:19,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:44:19,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:44:19,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:44:19,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:44:19,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:44:19" (1/1) ... [2024-10-14 17:44:19,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7347030c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:19, skipping insertion in model container [2024-10-14 17:44:19,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:44:19" (1/1) ... [2024-10-14 17:44:19,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:44:19,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:44:19,886 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 17:44:19,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@76fa9fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:19, skipping insertion in model container [2024-10-14 17:44:19,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:44:19,888 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:44:19,889 INFO L158 Benchmark]: Toolchain (without parser) took 274.67ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 103.6MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 17:44:19,890 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:44:19,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.85ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 103.6MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 17:44:19,892 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.85ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 103.6MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 528]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56160afe0156ee9cb1db810e306de9e54e614e31d545b68546457414a273604d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:44:21,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:44:21,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 17:44:21,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:44:21,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:44:21,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:44:21,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:44:21,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:44:21,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:44:21,492 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:44:21,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:44:21,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:44:21,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:44:21,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:44:21,493 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:44:21,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:44:21,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:44:21,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:44:21,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:44:21,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:44:21,495 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:44:21,495 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:44:21,495 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:44:21,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:44:21,496 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:44:21,496 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:44:21,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:44:21,496 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:44:21,497 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:44:21,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:44:21,497 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:44:21,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:44:21,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:44:21,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:44:21,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:44:21,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:44:21,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:44:21,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:44:21,498 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:44:21,498 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:44:21,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:44:21,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:44:21,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:44:21,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:44:21,500 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:44:21,500 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 -> 56160afe0156ee9cb1db810e306de9e54e614e31d545b68546457414a273604d [2024-10-14 17:44:21,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:44:21,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:44:21,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:44:21,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:44:21,736 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:44:21,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i [2024-10-14 17:44:22,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:44:23,146 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:44:23,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i [2024-10-14 17:44:23,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dd7ab618/5bbc1898c76e4f4da297bfe0f8cc1ec1/FLAGe6272d248 [2024-10-14 17:44:23,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dd7ab618/5bbc1898c76e4f4da297bfe0f8cc1ec1 [2024-10-14 17:44:23,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:44:23,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:44:23,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:44:23,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:44:23,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:44:23,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7ce13f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23, skipping insertion in model container [2024-10-14 17:44:23,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:44:23,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:44:23,466 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:44:23,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:44:23,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:44:23,507 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:44:23,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:44:23,564 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:44:23,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23 WrapperNode [2024-10-14 17:44:23,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:44:23,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:44:23,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:44:23,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:44:23,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,603 INFO L138 Inliner]: procedures = 117, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-10-14 17:44:23,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:44:23,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:44:23,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:44:23,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:44:23,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,636 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-10-14 17:44:23,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:44:23,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:44:23,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:44:23,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:44:23,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (1/1) ... [2024-10-14 17:44:23,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:44:23,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:44:23,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:44:23,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:44:23,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:44:23,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:44:23,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:44:23,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:44:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:44:23,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:44:23,822 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:44:23,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:44:24,043 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-10-14 17:44:24,043 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:44:24,088 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:44:24,088 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 17:44:24,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:44:24 BoogieIcfgContainer [2024-10-14 17:44:24,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:44:24,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:44:24,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:44:24,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:44:24,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:44:23" (1/3) ... [2024-10-14 17:44:24,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616c1fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:44:24, skipping insertion in model container [2024-10-14 17:44:24,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:23" (2/3) ... [2024-10-14 17:44:24,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616c1fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:44:24, skipping insertion in model container [2024-10-14 17:44:24,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:44:24" (3/3) ... [2024-10-14 17:44:24,097 INFO L112 eAbstractionObserver]: Analyzing ICFG insertionsort-alloca-1.i [2024-10-14 17:44:24,109 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:44:24,109 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-10-14 17:44:24,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:44:24,145 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2550e961, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:44:24,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-14 17:44:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 2.235294117647059) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:44:24,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:24,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:44:24,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:24,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash 106363065, now seen corresponding path program 1 times [2024-10-14 17:44:24,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:24,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801866218] [2024-10-14 17:44:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:24,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:24,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:24,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:24,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 17:44:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:24,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:44:24,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:24,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 17:44:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:24,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:24,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:24,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801866218] [2024-10-14 17:44:24,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801866218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:24,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:24,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:44:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146872364] [2024-10-14 17:44:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:24,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:44:24,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:24,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:44:24,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:44:24,329 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 2.235294117647059) internal successors, (38), 30 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 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:24,384 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-10-14 17:44:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:44:24,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:44:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:24,392 INFO L225 Difference]: With dead ends: 30 [2024-10-14 17:44:24,392 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 17:44:24,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:44:24,398 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:24,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:44:24,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 17:44:24,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 17:44:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-14 17:44:24,428 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 5 [2024-10-14 17:44:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:24,428 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-14 17:44:24,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-10-14 17:44:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:44:24,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:24,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:44:24,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:24,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:24,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:24,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash 106363066, now seen corresponding path program 1 times [2024-10-14 17:44:24,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:24,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740500137] [2024-10-14 17:44:24,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:24,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:24,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:24,635 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:24,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 17:44:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:24,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:44:24,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:24,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:44:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:24,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:24,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:24,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740500137] [2024-10-14 17:44:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740500137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:24,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:24,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:44:24,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199719939] [2024-10-14 17:44:24,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:24,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:44:24,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:24,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:44:24,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:44:24,711 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:24,820 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-10-14 17:44:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:44:24,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:44:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:24,821 INFO L225 Difference]: With dead ends: 36 [2024-10-14 17:44:24,821 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 17:44:24,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:44:24,822 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:24,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 63 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 17:44:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2024-10-14 17:44:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.8) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-14 17:44:24,827 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 5 [2024-10-14 17:44:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:24,827 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-14 17:44:24,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-14 17:44:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:44:24,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:24,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:44:24,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 17:44:25,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:25,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:25,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash 106422648, now seen corresponding path program 1 times [2024-10-14 17:44:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:25,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251988787] [2024-10-14 17:44:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:25,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:25,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:25,031 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:25,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 17:44:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:25,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 17:44:25,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:25,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:44:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:25,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:25,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:25,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251988787] [2024-10-14 17:44:25,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251988787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:25,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:25,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:44:25,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178916937] [2024-10-14 17:44:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:25,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:44:25,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:25,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:44:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:44:25,169 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:25,263 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-10-14 17:44:25,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:44:25,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:44:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:25,264 INFO L225 Difference]: With dead ends: 34 [2024-10-14 17:44:25,264 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 17:44:25,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:44:25,265 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:25,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 17:44:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-10-14 17:44:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-14 17:44:25,271 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 5 [2024-10-14 17:44:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:25,271 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-14 17:44:25,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-14 17:44:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:44:25,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:25,272 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 17:44:25,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 17:44:25,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:25,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:25,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash -864241822, now seen corresponding path program 1 times [2024-10-14 17:44:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:25,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954660950] [2024-10-14 17:44:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:25,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:25,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:25,482 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:25,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 17:44:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:25,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:44:25,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:25,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:25,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954660950] [2024-10-14 17:44:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954660950] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:25,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:25,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:44:25,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580536737] [2024-10-14 17:44:25,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:25,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:44:25,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:25,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:44:25,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:44:25,590 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:25,654 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-10-14 17:44:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:44:25,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:44:25,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:25,655 INFO L225 Difference]: With dead ends: 36 [2024-10-14 17:44:25,655 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 17:44:25,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:44:25,656 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:25,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 17:44:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-10-14 17:44:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-14 17:44:25,659 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 7 [2024-10-14 17:44:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:25,659 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-14 17:44:25,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-14 17:44:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:44:25,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:25,660 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 17:44:25,663 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 [2024-10-14 17:44:25,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:25,860 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:25,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash -806983520, now seen corresponding path program 1 times [2024-10-14 17:44:25,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:25,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892991376] [2024-10-14 17:44:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:25,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:25,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:25,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:25,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 17:44:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:25,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 17:44:25,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:25,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:44:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:26,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:26,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:26,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892991376] [2024-10-14 17:44:26,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892991376] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:26,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:26,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-14 17:44:26,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877138712] [2024-10-14 17:44:26,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:26,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:44:26,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:26,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:44:26,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:44:26,201 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:26,569 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-10-14 17:44:26,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:44:26,570 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:44:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:26,571 INFO L225 Difference]: With dead ends: 41 [2024-10-14 17:44:26,571 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 17:44:26,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2024-10-14 17:44:26,572 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:26,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 91 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:44:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 17:44:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 17:44:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 40 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) [2024-10-14 17:44:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-10-14 17:44:26,581 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 7 [2024-10-14 17:44:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:26,582 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-14 17:44:26,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-10-14 17:44:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:44:26,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:26,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:26,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 17:44:26,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:26,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:26,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:26,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1607754547, now seen corresponding path program 1 times [2024-10-14 17:44:26,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:26,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313680586] [2024-10-14 17:44:26,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:26,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:26,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:26,787 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:26,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 17:44:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:26,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:44:26,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:44:26,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:26,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:26,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313680586] [2024-10-14 17:44:26,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313680586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:26,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:26,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:44:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845314718] [2024-10-14 17:44:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:26,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:44:26,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:26,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:44:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:44:26,835 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 4 states, 4 states have (on average 2.25) 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) [2024-10-14 17:44:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:26,887 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-10-14 17:44:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:44:26,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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 [2024-10-14 17:44:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:26,889 INFO L225 Difference]: With dead ends: 43 [2024-10-14 17:44:26,890 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 17:44:26,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:44:26,891 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:26,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:44:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 17:44:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-14 17:44:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-14 17:44:26,898 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 9 [2024-10-14 17:44:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:26,898 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-14 17:44:26,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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) [2024-10-14 17:44:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-14 17:44:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:44:26,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:26,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:26,907 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 [2024-10-14 17:44:27,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:27,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:27,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1877866123, now seen corresponding path program 1 times [2024-10-14 17:44:27,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:27,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385643936] [2024-10-14 17:44:27,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:27,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:27,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:27,103 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:27,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 17:44:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:27,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:44:27,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:27,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 17:44:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:44:27,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:27,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:27,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385643936] [2024-10-14 17:44:27,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385643936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:27,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:27,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:44:27,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062608112] [2024-10-14 17:44:27,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:27,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:44:27,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:27,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:44:27,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:44:27,168 INFO L87 Difference]: Start difference. First operand 43 states and 50 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) [2024-10-14 17:44:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:27,236 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-14 17:44:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:44:27,236 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 [2024-10-14 17:44:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:27,237 INFO L225 Difference]: With dead ends: 38 [2024-10-14 17:44:27,237 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 17:44:27,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:44:27,237 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:27,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 17:44:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-14 17:44:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 37 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) [2024-10-14 17:44:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-10-14 17:44:27,240 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 9 [2024-10-14 17:44:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:27,240 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-14 17:44:27,240 INFO L472 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) [2024-10-14 17:44:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-10-14 17:44:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:44:27,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:27,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:27,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 17:44:27,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:27,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:27,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:27,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1877866124, now seen corresponding path program 1 times [2024-10-14 17:44:27,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:27,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307922014] [2024-10-14 17:44:27,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:27,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:27,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:27,448 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:27,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 17:44:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:27,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 17:44:27,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:27,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:44:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:44:27,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:27,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:27,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307922014] [2024-10-14 17:44:27,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307922014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:27,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:27,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:44:27,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209277515] [2024-10-14 17:44:27,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:27,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:44:27,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:27,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:44:27,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:44:27,610 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:27,748 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2024-10-14 17:44:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:44:27,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 17:44:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:27,748 INFO L225 Difference]: With dead ends: 47 [2024-10-14 17:44:27,749 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 17:44:27,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:44:27,749 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:27,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 17:44:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-10-14 17:44:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 39 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) [2024-10-14 17:44:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-10-14 17:44:27,752 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 9 [2024-10-14 17:44:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:27,752 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-14 17:44:27,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-10-14 17:44:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:44:27,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:27,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:27,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:27,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:27,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:27,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:27,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1699216024, now seen corresponding path program 1 times [2024-10-14 17:44:27,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:27,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899052629] [2024-10-14 17:44:27,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:27,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:27,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:27,957 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:27,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 17:44:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:27,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:44:27,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:28,032 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~malloc9#1.base_12| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc9#1.base_12| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc9#1.base_12|)))) is different from true [2024-10-14 17:44:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:44:28,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:28,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:28,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899052629] [2024-10-14 17:44:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899052629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:28,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:44:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107571129] [2024-10-14 17:44:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:28,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:44:28,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:28,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:44:28,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-14 17:44:28,034 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:28,078 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-10-14 17:44:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:44:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 17:44:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:28,079 INFO L225 Difference]: With dead ends: 39 [2024-10-14 17:44:28,079 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 17:44:28,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-14 17:44:28,080 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:28,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2024-10-14 17:44:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 17:44:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-14 17:44:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.48) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-14 17:44:28,082 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 10 [2024-10-14 17:44:28,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:28,082 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-14 17:44:28,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:28,082 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-14 17:44:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 17:44:28,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:28,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:28,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 17:44:28,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:28,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:28,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1562202032, now seen corresponding path program 1 times [2024-10-14 17:44:28,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:28,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364211501] [2024-10-14 17:44:28,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:28,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:28,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:28,286 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:28,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 17:44:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:28,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 17:44:28,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:28,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:44:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:44:28,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:28,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:28,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364211501] [2024-10-14 17:44:28,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364211501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:28,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:28,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:44:28,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940399353] [2024-10-14 17:44:28,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:28,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:44:28,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:28,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:44:28,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:44:28,478 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:28,652 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-10-14 17:44:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:44:28,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 17:44:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:28,653 INFO L225 Difference]: With dead ends: 45 [2024-10-14 17:44:28,653 INFO L226 Difference]: Without dead ends: 45 [2024-10-14 17:44:28,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:44:28,654 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:28,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 27 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-14 17:44:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2024-10-14 17:44:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.4375) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-10-14 17:44:28,657 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 12 [2024-10-14 17:44:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:28,657 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-10-14 17:44:28,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-10-14 17:44:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:44:28,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:28,658 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2024-10-14 17:44:28,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:28,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:28,860 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:28,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:28,861 INFO L85 PathProgramCache]: Analyzing trace with hash -950205928, now seen corresponding path program 2 times [2024-10-14 17:44:28,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:28,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735644164] [2024-10-14 17:44:28,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:44:28,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:28,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:28,866 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:28,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 17:44:28,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:44:28,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:44:28,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 17:44:28,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:28,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:44:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:29,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:29,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:29,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735644164] [2024-10-14 17:44:29,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735644164] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:29,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:29,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-14 17:44:29,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726443453] [2024-10-14 17:44:29,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:29,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:44:29,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:29,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:44:29,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:44:29,599 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:31,150 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2024-10-14 17:44:31,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 17:44:31,151 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:44:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:31,151 INFO L225 Difference]: With dead ends: 50 [2024-10-14 17:44:31,151 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 17:44:31,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2024-10-14 17:44:31,152 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:31,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 68 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:44:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 17:44:31,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-14 17:44:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-10-14 17:44:31,157 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 13 [2024-10-14 17:44:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:31,158 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-10-14 17:44:31,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-10-14 17:44:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:44:31,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:31,160 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:31,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 (12)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:31,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:31,361 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:31,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:31,361 INFO L85 PathProgramCache]: Analyzing trace with hash -699049751, now seen corresponding path program 1 times [2024-10-14 17:44:31,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:31,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248016874] [2024-10-14 17:44:31,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:31,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:31,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:31,363 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:31,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 17:44:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:31,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:44:31,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:44:31,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:31,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248016874] [2024-10-14 17:44:31,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248016874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:31,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:31,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:44:31,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810544408] [2024-10-14 17:44:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:31,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:44:31,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:31,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:44:31,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:44:31,427 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2024-10-14 17:44:31,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:31,495 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2024-10-14 17:44:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:44:31,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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 [2024-10-14 17:44:31,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:31,496 INFO L225 Difference]: With dead ends: 61 [2024-10-14 17:44:31,496 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 17:44:31,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:44:31,496 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:31,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 49 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:31,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 17:44:31,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2024-10-14 17:44:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 49 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) [2024-10-14 17:44:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2024-10-14 17:44:31,498 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 15 [2024-10-14 17:44:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:31,498 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-10-14 17:44:31,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2024-10-14 17:44:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2024-10-14 17:44:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:44:31,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:31,499 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:31,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 17:44:31,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:31,701 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:31,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:31,702 INFO L85 PathProgramCache]: Analyzing trace with hash -336954597, now seen corresponding path program 1 times [2024-10-14 17:44:31,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:31,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812176452] [2024-10-14 17:44:31,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:31,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:31,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:31,705 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:31,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 17:44:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:31,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 17:44:31,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:31,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:44:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:31,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:32,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:32,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812176452] [2024-10-14 17:44:32,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812176452] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:32,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:32,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-10-14 17:44:32,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617087935] [2024-10-14 17:44:32,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:32,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:44:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:32,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:44:32,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:44:32,309 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) 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) [2024-10-14 17:44:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:32,725 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-10-14 17:44:32,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:44:32,726 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) 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 16 [2024-10-14 17:44:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:32,726 INFO L225 Difference]: With dead ends: 53 [2024-10-14 17:44:32,726 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 17:44:32,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:44:32,727 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:32,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 48 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:44:32,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 17:44:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-14 17:44:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2024-10-14 17:44:32,729 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 16 [2024-10-14 17:44:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:32,730 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-10-14 17:44:32,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) 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) [2024-10-14 17:44:32,730 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2024-10-14 17:44:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 17:44:32,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:32,731 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:32,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:32,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:32,931 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:32,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:32,932 INFO L85 PathProgramCache]: Analyzing trace with hash 529754867, now seen corresponding path program 2 times [2024-10-14 17:44:32,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:32,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181772293] [2024-10-14 17:44:32,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:44:32,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:32,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:32,933 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:32,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 17:44:32,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:44:32,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:44:32,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 17:44:32,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:33,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:44:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:33,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:33,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:33,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181772293] [2024-10-14 17:44:33,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181772293] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:33,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:33,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-14 17:44:33,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123922121] [2024-10-14 17:44:33,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:33,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 17:44:33,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:33,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 17:44:33,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:44:33,508 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:33,947 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2024-10-14 17:44:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:44:33,947 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-14 17:44:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:33,948 INFO L225 Difference]: With dead ends: 77 [2024-10-14 17:44:33,948 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 17:44:33,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:44:33,949 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 94 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:33,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 66 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:44:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 17:44:33,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-14 17:44:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 76 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2024-10-14 17:44:33,955 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 107 transitions. Word has length 18 [2024-10-14 17:44:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:33,955 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 107 transitions. [2024-10-14 17:44:33,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 107 transitions. [2024-10-14 17:44:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 17:44:33,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:33,955 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:33,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-14 17:44:34,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:34,156 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:34,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1973845075, now seen corresponding path program 1 times [2024-10-14 17:44:34,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:34,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854251824] [2024-10-14 17:44:34,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:34,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:34,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:34,159 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:34,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 17:44:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:34,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:44:34,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:34,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:34,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:34,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854251824] [2024-10-14 17:44:34,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854251824] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:34,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:34,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-14 17:44:34,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985874625] [2024-10-14 17:44:34,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:34,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:44:34,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:34,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:44:34,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:44:34,261 INFO L87 Difference]: Start difference. First operand 77 states and 107 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:34,368 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2024-10-14 17:44:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:44:34,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-14 17:44:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:34,369 INFO L225 Difference]: With dead ends: 78 [2024-10-14 17:44:34,369 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 17:44:34,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:44:34,370 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:34,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 73 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 17:44:34,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2024-10-14 17:44:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 76 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) [2024-10-14 17:44:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2024-10-14 17:44:34,375 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 20 [2024-10-14 17:44:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:34,376 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2024-10-14 17:44:34,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2024-10-14 17:44:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:44:34,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:34,377 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:34,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:34,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:34,579 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:34,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2076037655, now seen corresponding path program 1 times [2024-10-14 17:44:34,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:34,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239568595] [2024-10-14 17:44:34,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:34,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:34,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:34,581 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:34,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 17:44:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:34,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 17:44:34,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:34,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:44:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:34,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:35,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:35,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239568595] [2024-10-14 17:44:35,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239568595] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:35,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:35,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2024-10-14 17:44:35,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922601619] [2024-10-14 17:44:35,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:35,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 17:44:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:35,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 17:44:35,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:44:35,192 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:35,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:35,940 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2024-10-14 17:44:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 17:44:35,941 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 17:44:35,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:35,941 INFO L225 Difference]: With dead ends: 99 [2024-10-14 17:44:35,941 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 17:44:35,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-10-14 17:44:35,942 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:35,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 66 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:44:35,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 17:44:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-10-14 17:44:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.375) internal successors, (121), 92 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2024-10-14 17:44:35,946 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 21 [2024-10-14 17:44:35,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:35,946 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2024-10-14 17:44:35,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2024-10-14 17:44:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:44:35,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:35,946 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:35,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-14 17:44:36,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:36,147 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:36,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:36,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1059649126, now seen corresponding path program 1 times [2024-10-14 17:44:36,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:36,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474442226] [2024-10-14 17:44:36,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:36,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:36,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:36,149 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:36,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-14 17:44:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:36,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 17:44:36,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:36,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:44:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:36,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:36,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:36,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474442226] [2024-10-14 17:44:36,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474442226] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:36,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:36,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2024-10-14 17:44:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657822537] [2024-10-14 17:44:36,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:36,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 17:44:36,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:36,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 17:44:36,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:44:36,743 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:37,363 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2024-10-14 17:44:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:44:37,364 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 17:44:37,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:37,364 INFO L225 Difference]: With dead ends: 94 [2024-10-14 17:44:37,364 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 17:44:37,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-10-14 17:44:37,365 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 54 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:37,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 47 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:44:37,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 17:44:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2024-10-14 17:44:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 87 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2024-10-14 17:44:37,368 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 21 [2024-10-14 17:44:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:37,368 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2024-10-14 17:44:37,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2024-10-14 17:44:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 17:44:37,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:37,369 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1] [2024-10-14 17:44:37,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:37,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:37,570 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:37,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:37,570 INFO L85 PathProgramCache]: Analyzing trace with hash -965949688, now seen corresponding path program 3 times [2024-10-14 17:44:37,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:37,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834307090] [2024-10-14 17:44:37,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:44:37,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:37,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:37,573 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:37,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-14 17:44:37,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-14 17:44:37,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:44:37,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 17:44:37,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:37,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:44:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:38,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:39,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:39,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834307090] [2024-10-14 17:44:39,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834307090] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:39,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:39,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2024-10-14 17:44:39,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864916668] [2024-10-14 17:44:39,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:39,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 17:44:39,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:39,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 17:44:39,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2024-10-14 17:44:39,427 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:50,468 INFO L93 Difference]: Finished difference Result 112 states and 147 transitions. [2024-10-14 17:44:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-14 17:44:50,468 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-14 17:44:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:50,469 INFO L225 Difference]: With dead ends: 112 [2024-10-14 17:44:50,469 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 17:44:50,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1158, Invalid=2502, Unknown=0, NotChecked=0, Total=3660 [2024-10-14 17:44:50,470 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 96 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:50,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 110 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 17:44:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 17:44:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-14 17:44:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 109 states have (on average 1.348623853211009) internal successors, (147), 111 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 147 transitions. [2024-10-14 17:44:50,474 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 147 transitions. Word has length 25 [2024-10-14 17:44:50,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:50,474 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 147 transitions. [2024-10-14 17:44:50,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 147 transitions. [2024-10-14 17:44:50,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 17:44:50,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:50,475 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:50,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:50,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:50,678 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:50,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:50,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1567199023, now seen corresponding path program 1 times [2024-10-14 17:44:50,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:50,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380353873] [2024-10-14 17:44:50,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:50,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:50,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:50,681 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:50,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-14 17:44:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:50,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:44:50,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 17:44:50,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 17:44:50,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380353873] [2024-10-14 17:44:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380353873] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:50,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:50,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-14 17:44:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697128540] [2024-10-14 17:44:50,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:50,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:44:50,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:50,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:44:50,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:44:50,806 INFO L87 Difference]: Start difference. First operand 112 states and 147 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:50,962 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2024-10-14 17:44:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 17:44:50,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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) Word has length 33 [2024-10-14 17:44:50,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:50,964 INFO L225 Difference]: With dead ends: 127 [2024-10-14 17:44:50,964 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 17:44:50,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2024-10-14 17:44:50,964 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 87 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:50,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 57 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 17:44:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2024-10-14 17:44:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 109 states have (on average 1.311926605504587) internal successors, (143), 111 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2024-10-14 17:44:50,966 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 143 transitions. Word has length 33 [2024-10-14 17:44:50,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:50,966 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 143 transitions. [2024-10-14 17:44:50,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2024-10-14 17:44:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 17:44:50,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:50,967 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:50,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:51,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:51,167 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:51,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1437361395, now seen corresponding path program 1 times [2024-10-14 17:44:51,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:51,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837072066] [2024-10-14 17:44:51,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:51,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:51,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:51,170 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:51,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-14 17:44:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:51,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:44:51,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:51,290 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:51,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:51,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837072066] [2024-10-14 17:44:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837072066] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:51,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:51,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-10-14 17:44:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186244820] [2024-10-14 17:44:51,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:51,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 17:44:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:51,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 17:44:51,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:44:51,376 INFO L87 Difference]: Start difference. First operand 112 states and 143 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:51,575 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2024-10-14 17:44:51,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:44:51,576 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-14 17:44:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:51,579 INFO L225 Difference]: With dead ends: 114 [2024-10-14 17:44:51,579 INFO L226 Difference]: Without dead ends: 114 [2024-10-14 17:44:51,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:44:51,580 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 61 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:51,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 115 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:44:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-14 17:44:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2024-10-14 17:44:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 108 states have (on average 1.2962962962962963) internal successors, (140), 110 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 140 transitions. [2024-10-14 17:44:51,582 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 140 transitions. Word has length 33 [2024-10-14 17:44:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:51,582 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 140 transitions. [2024-10-14 17:44:51,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 140 transitions. [2024-10-14 17:44:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 17:44:51,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:51,582 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:51,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:51,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:51,786 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:51,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1654725773, now seen corresponding path program 2 times [2024-10-14 17:44:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:51,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256869549] [2024-10-14 17:44:51,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:44:51,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:51,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:51,787 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:51,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-14 17:44:51,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:44:51,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:44:51,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 17:44:51,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:51,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:44:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:52,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:53,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256869549] [2024-10-14 17:44:53,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256869549] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:53,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:53,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-10-14 17:44:53,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886535509] [2024-10-14 17:44:53,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:53,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 17:44:53,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:53,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 17:44:53,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-14 17:44:53,360 INFO L87 Difference]: Start difference. First operand 111 states and 140 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 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) [2024-10-14 17:44:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:56,377 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2024-10-14 17:44:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 17:44:56,378 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 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) Word has length 34 [2024-10-14 17:44:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:56,378 INFO L225 Difference]: With dead ends: 149 [2024-10-14 17:44:56,378 INFO L226 Difference]: Without dead ends: 149 [2024-10-14 17:44:56,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=411, Invalid=1395, Unknown=0, NotChecked=0, Total=1806 [2024-10-14 17:44:56,379 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 204 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:56,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 116 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 17:44:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-14 17:44:56,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2024-10-14 17:44:56,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 134 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 171 transitions. [2024-10-14 17:44:56,382 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 171 transitions. Word has length 34 [2024-10-14 17:44:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:56,382 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 171 transitions. [2024-10-14 17:44:56,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 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) [2024-10-14 17:44:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 171 transitions. [2024-10-14 17:44:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 17:44:56,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:56,384 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:56,388 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 [2024-10-14 17:44:56,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:56,584 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:44:56,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:56,585 INFO L85 PathProgramCache]: Analyzing trace with hash 931694580, now seen corresponding path program 3 times [2024-10-14 17:44:56,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:56,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458834809] [2024-10-14 17:44:56,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:44:56,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:56,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:56,586 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:44:56,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-14 17:44:56,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:44:56,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:44:56,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 17:44:56,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:56,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:44:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 17:44:57,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 17:44:59,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:59,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458834809] [2024-10-14 17:44:59,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458834809] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:59,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:59,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-10-14 17:44:59,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220404930] [2024-10-14 17:44:59,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:59,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 17:44:59,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:59,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 17:44:59,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-10-14 17:44:59,449 INFO L87 Difference]: Start difference. First operand 135 states and 171 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:45:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:45:00,727 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2024-10-14 17:45:00,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 17:45:00,729 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-14 17:45:00,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:45:00,730 INFO L225 Difference]: With dead ends: 138 [2024-10-14 17:45:00,730 INFO L226 Difference]: Without dead ends: 138 [2024-10-14 17:45:00,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:45:00,731 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 63 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:45:00,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 52 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 17:45:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-14 17:45:00,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2024-10-14 17:45:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 116 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:45:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2024-10-14 17:45:00,733 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 39 [2024-10-14 17:45:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:45:00,733 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2024-10-14 17:45:00,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:45:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2024-10-14 17:45:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 17:45:00,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:45:00,735 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 17:45:00,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-10-14 17:45:00,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:45:00,936 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:45:00,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:45:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1165215725, now seen corresponding path program 3 times [2024-10-14 17:45:00,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:45:00,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294229360] [2024-10-14 17:45:00,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:45:00,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:45:00,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:45:00,937 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:45:00,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-14 17:45:01,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 17:45:01,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:45:01,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 17:45:01,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:45:01,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:45:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 17:45:01,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:45:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 17:45:05,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:45:05,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294229360] [2024-10-14 17:45:05,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294229360] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:45:05,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:45:05,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2024-10-14 17:45:05,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210433077] [2024-10-14 17:45:05,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:45:05,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 17:45:05,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:45:05,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 17:45:05,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2024-10-14 17:45:05,825 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:45:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:45:14,022 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2024-10-14 17:45:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-14 17:45:14,025 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-14 17:45:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:45:14,025 INFO L225 Difference]: With dead ends: 188 [2024-10-14 17:45:14,025 INFO L226 Difference]: Without dead ends: 140 [2024-10-14 17:45:14,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=393, Invalid=2057, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 17:45:14,026 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 119 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:45:14,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 57 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 17:45:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-14 17:45:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 115. [2024-10-14 17:45:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 113 states have (on average 1.2831858407079646) internal successors, (145), 114 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:45:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 145 transitions. [2024-10-14 17:45:14,028 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 145 transitions. Word has length 47 [2024-10-14 17:45:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:45:14,028 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 145 transitions. [2024-10-14 17:45:14,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:45:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2024-10-14 17:45:14,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 17:45:14,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:45:14,029 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1] [2024-10-14 17:45:14,033 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 [2024-10-14 17:45:14,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:45:14,229 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-14 17:45:14,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:45:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash -48719640, now seen corresponding path program 4 times [2024-10-14 17:45:14,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:45:14,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552082780] [2024-10-14 17:45:14,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 17:45:14,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:45:14,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:45:14,231 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:45:14,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-14 17:45:14,399 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 17:45:14,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:45:14,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 17:45:14,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:45:14,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:45:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:45:15,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:45:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:45:20,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:45:20,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552082780] [2024-10-14 17:45:20,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552082780] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:45:20,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:45:20,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2024-10-14 17:45:20,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548833122] [2024-10-14 17:45:20,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:45:20,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-14 17:45:20,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:45:20,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-14 17:45:20,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=2126, Unknown=0, NotChecked=0, Total=2862 [2024-10-14 17:45:20,402 INFO L87 Difference]: Start difference. First operand 115 states and 145 transitions. Second operand has 54 states, 53 states have (on average 1.830188679245283) internal successors, (97), 54 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) [2024-10-14 17:45:44,845 WARN L286 SmtUtils]: Spent 13.03s on a formula simplification. DAG size of input: 253 DAG size of output: 252 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-14 17:45:52,805 WARN L286 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 246 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)