./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-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/memsafety/20020406-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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:52:45,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:52:46,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:52:46,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:52:46,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:52:46,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:52:46,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:52:46,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:52:46,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:52:46,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:52:46,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:52:46,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:52:46,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:52:46,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:52:46,098 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:52:46,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:52:46,099 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:52:46,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:52:46,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:52:46,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:52:46,100 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:52:46,102 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:52:46,102 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:52:46,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:52:46,103 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:52:46,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:52:46,104 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:52:46,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:52:46,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:52:46,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:52:46,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:52:46,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:52:46,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:52:46,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:52:46,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:52:46,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:52:46,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:52:46,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:52:46,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:52:46,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:52:46,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:52:46,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:52:46,108 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2024-10-14 17:52:46,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:52:46,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:52:46,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:52:46,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:52:46,394 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:52:46,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2024-10-14 17:52:47,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:52:48,093 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:52:48,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2024-10-14 17:52:48,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e06d14cea/d1bcbedec6094eb8b8ed4f5301aead6d/FLAG20307c50b [2024-10-14 17:52:48,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e06d14cea/d1bcbedec6094eb8b8ed4f5301aead6d [2024-10-14 17:52:48,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:52:48,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:52:48,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:52:48,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:52:48,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:52:48,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:52:48" (1/1) ... [2024-10-14 17:52:48,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f387744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:48, skipping insertion in model container [2024-10-14 17:52:48,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:52:48" (1/1) ... [2024-10-14 17:52:48,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:52:48,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:52:48,633 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:52:48,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@bec76ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:48, skipping insertion in model container [2024-10-14 17:52:48,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:52:48,636 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:52:48,638 INFO L158 Benchmark]: Toolchain (without parser) took 504.61ms. Allocated memory is still 176.2MB. Free memory was 117.7MB in the beginning and 101.7MB in the end (delta: 16.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 17:52:48,639 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:52:48,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.38ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 101.7MB in the end (delta: 15.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 17:52:48,641 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.18ms. Allocated memory is still 176.2MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.38ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 101.7MB in the end (delta: 15.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 897]: 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/memsafety/20020406-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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:52:50,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:52:50,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 17:52:50,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:52:50,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:52:50,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:52:50,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:52:50,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:52:50,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:52:50,806 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:52:50,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:52:50,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:52:50,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:52:50,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:52:50,810 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:52:50,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:52:50,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:52:50,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:52:50,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:52:50,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:52:50,812 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:52:50,816 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:52:50,816 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:52:50,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:52:50,817 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:52:50,817 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:52:50,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:52:50,818 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:52:50,818 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:52:50,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:52:50,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:52:50,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:52:50,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:52:50,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:52:50,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:52:50,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:52:50,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:52:50,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:52:50,821 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:52:50,821 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:52:50,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:52:50,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:52:50,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:52:50,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:52:50,823 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:52:50,823 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2024-10-14 17:52:51,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:52:51,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:52:51,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:52:51,192 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:52:51,194 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:52:51,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2024-10-14 17:52:52,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:52:53,064 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:52:53,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2024-10-14 17:52:53,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c59f91eae/d9fa59cddc77454fada532ffa9fe4268/FLAG9205bb783 [2024-10-14 17:52:53,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c59f91eae/d9fa59cddc77454fada532ffa9fe4268 [2024-10-14 17:52:53,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:52:53,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:52:53,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:52:53,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:52:53,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:52:53,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:52:53" (1/1) ... [2024-10-14 17:52:53,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b87413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:53, skipping insertion in model container [2024-10-14 17:52:53,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:52:53" (1/1) ... [2024-10-14 17:52:53,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:52:53,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:52:53,924 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:52:53,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:52:53,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:52:53,988 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:52:54,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:52:54,111 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:52:54,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:54 WrapperNode [2024-10-14 17:52:54,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:52:54,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:52:54,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:52:54,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:52:54,121 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:52:54" (1/1) ... [2024-10-14 17:52:54,151 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:52:54" (1/1) ... [2024-10-14 17:52:54,187 INFO L138 Inliner]: procedures = 286, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-10-14 17:52:54,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:52:54,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:52:54,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:52:54,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:52:54,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:54" (1/1) ... [2024-10-14 17:52:54,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:54" (1/1) ... [2024-10-14 17:52:54,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:54" (1/1) ... [2024-10-14 17:52:54,251 INFO L175 MemorySlicer]: Split 30 memory accesses to 4 slices as follows [2, 9, 17, 2]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 16 writes are split as follows [0, 6, 8, 2]. [2024-10-14 17:52:54,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:54" (1/1) ... [2024-10-14 17:52:54,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:54" (1/1) ... [2024-10-14 17:52:54,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:54" (1/1) ... [2024-10-14 17:52:54,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:54" (1/1) ... [2024-10-14 17:52:54,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:54" (1/1) ... [2024-10-14 17:52:54,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:54" (1/1) ... [2024-10-14 17:52:54,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:52:54,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:52:54,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:52:54,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:52:54,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:54" (1/1) ... [2024-10-14 17:52:54,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:52:54,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:52:54,330 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:52:54,332 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:52:54,364 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2024-10-14 17:52:54,365 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2024-10-14 17:52:54,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:52:54,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:52:54,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 17:52:54,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 17:52:54,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:52:54,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:52:54,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:52:54,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:52:54,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-14 17:52:54,366 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2024-10-14 17:52:54,366 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2024-10-14 17:52:54,366 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2024-10-14 17:52:54,366 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2024-10-14 17:52:54,367 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2024-10-14 17:52:54,367 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2024-10-14 17:52:54,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:52:54,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:52:54,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:52:54,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 17:52:54,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 17:52:54,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:52:54,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:52:54,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 17:52:54,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 17:52:54,369 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2024-10-14 17:52:54,369 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2024-10-14 17:52:54,369 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2024-10-14 17:52:54,369 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2024-10-14 17:52:54,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:52:54,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:52:54,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:52:54,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:52:54,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:52:54,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-14 17:52:54,370 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2024-10-14 17:52:54,370 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2024-10-14 17:52:54,370 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2024-10-14 17:52:54,371 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2024-10-14 17:52:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:52:54,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:52:54,551 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:52:54,553 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:52:55,322 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2024-10-14 17:52:55,322 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:52:55,386 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:52:55,386 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 17:52:55,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:52:55 BoogieIcfgContainer [2024-10-14 17:52:55,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:52:55,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:52:55,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:52:55,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:52:55,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:52:53" (1/3) ... [2024-10-14 17:52:55,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b7de68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:52:55, skipping insertion in model container [2024-10-14 17:52:55,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:54" (2/3) ... [2024-10-14 17:52:55,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b7de68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:52:55, skipping insertion in model container [2024-10-14 17:52:55,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:52:55" (3/3) ... [2024-10-14 17:52:55,395 INFO L112 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2024-10-14 17:52:55,410 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:52:55,410 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2024-10-14 17:52:55,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:52:55,465 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;@59837318, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:52:55,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-10-14 17:52:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 70 states have (on average 1.9428571428571428) internal successors, (136), 126 states have internal predecessors, (136), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 17:52:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 17:52:55,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:55,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 17:52:55,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:52:55,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:55,482 INFO L85 PathProgramCache]: Analyzing trace with hash 11050797, now seen corresponding path program 1 times [2024-10-14 17:52:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:52:55,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329137667] [2024-10-14 17:52:55,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:55,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:52:55,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:52:55,493 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:52:55,494 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:52:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:55,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:52:55,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:52:55,662 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:52:55,673 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:52:55,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:52:55,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:52:55,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329137667] [2024-10-14 17:52:55,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329137667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:55,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:55,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:52:55,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468048572] [2024-10-14 17:52:55,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:55,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:52:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:52:55,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:52:55,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:52:55,716 INFO L87 Difference]: Start difference. First operand has 167 states, 70 states have (on average 1.9428571428571428) internal successors, (136), 126 states have internal predecessors, (136), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:56,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:56,080 INFO L93 Difference]: Finished difference Result 162 states and 198 transitions. [2024-10-14 17:52:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:52:56,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 17:52:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:56,095 INFO L225 Difference]: With dead ends: 162 [2024-10-14 17:52:56,096 INFO L226 Difference]: Without dead ends: 161 [2024-10-14 17:52:56,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:52:56,104 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 11 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:56,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 297 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:52:56,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-14 17:52:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-10-14 17:52:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 120 states have internal predecessors, (127), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 17:52:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 197 transitions. [2024-10-14 17:52:56,172 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 197 transitions. Word has length 4 [2024-10-14 17:52:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:56,178 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 197 transitions. [2024-10-14 17:52:56,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 197 transitions. [2024-10-14 17:52:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 17:52:56,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:56,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 17:52:56,187 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:52:56,380 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:52:56,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:52:56,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash 11050798, now seen corresponding path program 1 times [2024-10-14 17:52:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:52:56,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993963896] [2024-10-14 17:52:56,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:56,382 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:52:56,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:52:56,384 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:52:56,385 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:52:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:56,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:52:56,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:52:56,478 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:52:56,489 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:52:56,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:52:56,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:52:56,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993963896] [2024-10-14 17:52:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993963896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:56,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:56,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:52:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450716606] [2024-10-14 17:52:56,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:56,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:52:56,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:52:56,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:52:56,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:52:56,493 INFO L87 Difference]: Start difference. First operand 161 states and 197 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:56,798 INFO L93 Difference]: Finished difference Result 162 states and 198 transitions. [2024-10-14 17:52:56,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:52:56,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 17:52:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:56,800 INFO L225 Difference]: With dead ends: 162 [2024-10-14 17:52:56,800 INFO L226 Difference]: Without dead ends: 162 [2024-10-14 17:52:56,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:52:56,801 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 3 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:56,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 309 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:52:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-14 17:52:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-14 17:52:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 70 states have (on average 1.8285714285714285) internal successors, (128), 121 states have internal predecessors, (128), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 17:52:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 198 transitions. [2024-10-14 17:52:56,830 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 198 transitions. Word has length 4 [2024-10-14 17:52:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:56,830 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 198 transitions. [2024-10-14 17:52:56,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 198 transitions. [2024-10-14 17:52:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:52:56,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:56,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:52:56,835 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:52:57,031 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:52:57,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:52:57,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:57,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2029880815, now seen corresponding path program 1 times [2024-10-14 17:52:57,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:52:57,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010880282] [2024-10-14 17:52:57,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:57,038 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:52:57,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:52:57,041 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:52:57,043 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:52:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:57,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:52:57,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:52:57,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 17:52:57,167 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:52:57,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:52:57,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 17:52:57,260 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 17:52:57,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 17:52:57,283 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:52:57,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:52:57,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:52:57,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010880282] [2024-10-14 17:52:57,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010880282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:57,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:57,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:52:57,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399375817] [2024-10-14 17:52:57,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:57,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:52:57,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:52:57,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:52:57,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:52:57,288 INFO L87 Difference]: Start difference. First operand 162 states and 198 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:57,576 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2024-10-14 17:52:57,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:52:57,576 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:52:57,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:57,580 INFO L225 Difference]: With dead ends: 158 [2024-10-14 17:52:57,580 INFO L226 Difference]: Without dead ends: 158 [2024-10-14 17:52:57,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:52:57,583 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 20 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:57,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 298 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:52:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-14 17:52:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2024-10-14 17:52:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 68 states have (on average 1.7941176470588236) internal successors, (122), 115 states have internal predecessors, (122), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 17:52:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 192 transitions. [2024-10-14 17:52:57,601 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 192 transitions. Word has length 6 [2024-10-14 17:52:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:57,601 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 192 transitions. [2024-10-14 17:52:57,601 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2024-10-14 17:52:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:52:57,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:57,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:57,607 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:52:57,805 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:52:57,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:52:57,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:57,807 INFO L85 PathProgramCache]: Analyzing trace with hash 800610903, now seen corresponding path program 1 times [2024-10-14 17:52:57,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:52:57,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434751733] [2024-10-14 17:52:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:57,808 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:52:57,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:52:57,809 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:52:57,810 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:52:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:57,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:52:57,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:52:57,906 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:52:57,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 17:52:57,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 17:52:57,964 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:52:57,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:52:57,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:52:57,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434751733] [2024-10-14 17:52:57,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434751733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:57,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:57,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:52:57,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165022403] [2024-10-14 17:52:57,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:57,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:52:57,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:52:57,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:52:57,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:52:57,966 INFO L87 Difference]: Start difference. First operand 156 states and 192 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:58,412 INFO L93 Difference]: Finished difference Result 157 states and 193 transitions. [2024-10-14 17:52:58,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:52:58,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:52:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:58,414 INFO L225 Difference]: With dead ends: 157 [2024-10-14 17:52:58,414 INFO L226 Difference]: Without dead ends: 157 [2024-10-14 17:52:58,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:52:58,415 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 9 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:58,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 557 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:52:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-14 17:52:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2024-10-14 17:52:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 114 states have internal predecessors, (121), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 17:52:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 191 transitions. [2024-10-14 17:52:58,438 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 191 transitions. Word has length 8 [2024-10-14 17:52:58,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:58,439 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 191 transitions. [2024-10-14 17:52:58,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 191 transitions. [2024-10-14 17:52:58,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:52:58,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:58,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:58,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 17:52:58,641 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:52:58,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:52:58,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:58,642 INFO L85 PathProgramCache]: Analyzing trace with hash -950865727, now seen corresponding path program 1 times [2024-10-14 17:52:58,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:52:58,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844805013] [2024-10-14 17:52:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:58,643 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:52:58,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:52:58,647 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:52:58,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 17:52:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:58,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 17:52:58,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:52:58,776 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:52:58,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 17:52:58,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 17:52:58,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 17:52:58,905 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:52:58,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:52:58,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:52:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844805013] [2024-10-14 17:52:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844805013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:58,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:58,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:52:58,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582092319] [2024-10-14 17:52:58,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:58,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:52:58,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:52:58,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:52:58,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:52:58,907 INFO L87 Difference]: Start difference. First operand 155 states and 191 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:59,504 INFO L93 Difference]: Finished difference Result 166 states and 202 transitions. [2024-10-14 17:52:59,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:52:59,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 17:52:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:59,507 INFO L225 Difference]: With dead ends: 166 [2024-10-14 17:52:59,508 INFO L226 Difference]: Without dead ends: 166 [2024-10-14 17:52:59,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:52:59,509 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 18 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:59,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 892 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:52:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-14 17:52:59,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-14 17:52:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 124 states have internal predecessors, (132), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 17:52:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 202 transitions. [2024-10-14 17:52:59,523 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 202 transitions. Word has length 9 [2024-10-14 17:52:59,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:59,523 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 202 transitions. [2024-10-14 17:52:59,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 202 transitions. [2024-10-14 17:52:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:52:59,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:59,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:59,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 17:52:59,727 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:52:59,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:52:59,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1802196770, now seen corresponding path program 1 times [2024-10-14 17:52:59,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:52:59,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945645934] [2024-10-14 17:52:59,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:59,728 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:52:59,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:52:59,731 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:52:59,732 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:52:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:59,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:52:59,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:52:59,913 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:52:59,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:52:59,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:52:59,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945645934] [2024-10-14 17:52:59,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945645934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:59,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:59,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:52:59,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415781937] [2024-10-14 17:52:59,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:59,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:52:59,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:52:59,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:52:59,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:52:59,915 INFO L87 Difference]: Start difference. First operand 166 states and 202 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:53:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:00,164 INFO L93 Difference]: Finished difference Result 174 states and 214 transitions. [2024-10-14 17:53:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:53:00,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-14 17:53:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:00,167 INFO L225 Difference]: With dead ends: 174 [2024-10-14 17:53:00,167 INFO L226 Difference]: Without dead ends: 171 [2024-10-14 17:53:00,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:53:00,168 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 11 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:00,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 649 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:53:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-14 17:53:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-14 17:53:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 82 states have (on average 1.670731707317073) internal successors, (137), 129 states have internal predecessors, (137), 35 states have call successors, (35), 9 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2024-10-14 17:53:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 211 transitions. [2024-10-14 17:53:00,178 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 211 transitions. Word has length 15 [2024-10-14 17:53:00,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:00,178 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 211 transitions. [2024-10-14 17:53:00,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:53:00,179 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2024-10-14 17:53:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:53:00,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:00,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:00,184 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:53:00,380 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:53:00,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:00,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:00,381 INFO L85 PathProgramCache]: Analyzing trace with hash -488975304, now seen corresponding path program 1 times [2024-10-14 17:53:00,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:00,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027496800] [2024-10-14 17:53:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:00,381 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:53:00,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:00,383 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:53:00,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 17:53:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:00,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:53:00,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:53:00,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:53:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:53:00,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:00,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027496800] [2024-10-14 17:53:00,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027496800] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:53:00,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:53:00,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-14 17:53:00,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033782584] [2024-10-14 17:53:00,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:53:00,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 17:53:00,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:53:00,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 17:53:00,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:53:00,796 INFO L87 Difference]: Start difference. First operand 171 states and 211 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:53:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:01,411 INFO L93 Difference]: Finished difference Result 200 states and 254 transitions. [2024-10-14 17:53:01,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 17:53:01,412 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-14 17:53:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:01,414 INFO L225 Difference]: With dead ends: 200 [2024-10-14 17:53:01,414 INFO L226 Difference]: Without dead ends: 194 [2024-10-14 17:53:01,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2024-10-14 17:53:01,415 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 49 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:01,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 800 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:53:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-14 17:53:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2024-10-14 17:53:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 98 states have (on average 1.6428571428571428) internal successors, (161), 144 states have internal predecessors, (161), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2024-10-14 17:53:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 235 transitions. [2024-10-14 17:53:01,434 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 235 transitions. Word has length 16 [2024-10-14 17:53:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:01,434 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 235 transitions. [2024-10-14 17:53:01,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:53:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 235 transitions. [2024-10-14 17:53:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 17:53:01,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:01,435 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:01,443 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:53:01,638 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:53:01,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:01,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash 175222622, now seen corresponding path program 2 times [2024-10-14 17:53:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:01,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506040780] [2024-10-14 17:53:01,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:53:01,639 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:53:01,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:01,641 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:53:01,642 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:53:01,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:53:01,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:53:01,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:53:01,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 17:53:01,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:53:01,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:01,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506040780] [2024-10-14 17:53:01,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506040780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:53:01,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:53:01,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:53:01,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969907936] [2024-10-14 17:53:01,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:53:01,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:53:01,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:53:01,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:53:01,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:53:01,788 INFO L87 Difference]: Start difference. First operand 187 states and 235 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:53:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:02,126 INFO L93 Difference]: Finished difference Result 185 states and 233 transitions. [2024-10-14 17:53:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:53:02,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-14 17:53:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:02,128 INFO L225 Difference]: With dead ends: 185 [2024-10-14 17:53:02,128 INFO L226 Difference]: Without dead ends: 185 [2024-10-14 17:53:02,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:53:02,129 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 5 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:02,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 528 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:53:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-14 17:53:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-10-14 17:53:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 98 states have (on average 1.6224489795918366) internal successors, (159), 142 states have internal predecessors, (159), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2024-10-14 17:53:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2024-10-14 17:53:02,141 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 19 [2024-10-14 17:53:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:02,142 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2024-10-14 17:53:02,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:53:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2024-10-14 17:53:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 17:53:02,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:02,143 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:02,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:53:02,343 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:53:02,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:02,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash 175222623, now seen corresponding path program 1 times [2024-10-14 17:53:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559505914] [2024-10-14 17:53:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:02,345 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:53:02,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:02,346 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:53:02,347 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:53:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:02,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 17:53:02,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:53:02,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:53:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:53:02,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:02,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559505914] [2024-10-14 17:53:02,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559505914] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:53:02,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:53:02,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-10-14 17:53:02,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012851271] [2024-10-14 17:53:02,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:53:02,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 17:53:02,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:53:02,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 17:53:02,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2024-10-14 17:53:02,947 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:53:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:04,073 INFO L93 Difference]: Finished difference Result 212 states and 277 transitions. [2024-10-14 17:53:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 17:53:04,074 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-14 17:53:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:04,076 INFO L225 Difference]: With dead ends: 212 [2024-10-14 17:53:04,076 INFO L226 Difference]: Without dead ends: 206 [2024-10-14 17:53:04,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=340, Invalid=850, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 17:53:04,077 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 104 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:04,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1249 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 17:53:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-14 17:53:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2024-10-14 17:53:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 101 states have (on average 1.5940594059405941) internal successors, (161), 145 states have internal predecessors, (161), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2024-10-14 17:53:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 235 transitions. [2024-10-14 17:53:04,090 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 235 transitions. Word has length 19 [2024-10-14 17:53:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:04,092 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 235 transitions. [2024-10-14 17:53:04,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:53:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 235 transitions. [2024-10-14 17:53:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 17:53:04,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:04,094 INFO L215 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:04,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-14 17:53:04,297 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:53:04,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:04,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:04,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1519946273, now seen corresponding path program 2 times [2024-10-14 17:53:04,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:04,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704179583] [2024-10-14 17:53:04,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:53:04,303 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:53:04,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:04,305 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:53:04,306 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:53:04,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:53:04,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:53:04,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 17:53:04,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 17:53:04,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:53:04,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:04,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704179583] [2024-10-14 17:53:04,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704179583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:53:04,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:53:04,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:53:04,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039173231] [2024-10-14 17:53:04,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:53:04,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:53:04,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:53:04,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:53:04,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:53:04,580 INFO L87 Difference]: Start difference. First operand 188 states and 235 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:53:04,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:04,994 INFO L93 Difference]: Finished difference Result 186 states and 233 transitions. [2024-10-14 17:53:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:53:04,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-14 17:53:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:04,996 INFO L225 Difference]: With dead ends: 186 [2024-10-14 17:53:04,996 INFO L226 Difference]: Without dead ends: 186 [2024-10-14 17:53:04,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:53:04,996 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 10 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:04,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 686 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:53:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-14 17:53:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-10-14 17:53:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 101 states have (on average 1.5742574257425743) internal successors, (159), 143 states have internal predecessors, (159), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2024-10-14 17:53:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2024-10-14 17:53:05,004 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 23 [2024-10-14 17:53:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:05,005 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2024-10-14 17:53:05,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:53:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2024-10-14 17:53:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 17:53:05,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:05,006 INFO L215 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:05,011 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:53:05,209 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:53:05,210 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:05,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash 126305949, now seen corresponding path program 1 times [2024-10-14 17:53:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:05,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404164059] [2024-10-14 17:53:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:05,211 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:53:05,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:05,214 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:53:05,215 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:53:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:05,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 17:53:05,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:05,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 17:53:05,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 17:53:05,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 17 [2024-10-14 17:53:05,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 17 [2024-10-14 17:53:05,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 17:53:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 17:53:05,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:53:05,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:05,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404164059] [2024-10-14 17:53:05,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404164059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:53:05,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:53:05,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:53:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282267512] [2024-10-14 17:53:05,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:53:05,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:53:05,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:53:05,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:53:05,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:53:05,594 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:53:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:06,177 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2024-10-14 17:53:06,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:53:06,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-14 17:53:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:06,179 INFO L225 Difference]: With dead ends: 188 [2024-10-14 17:53:06,179 INFO L226 Difference]: Without dead ends: 188 [2024-10-14 17:53:06,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:53:06,180 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 4 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:06,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 914 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 17:53:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-14 17:53:06,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-10-14 17:53:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 103 states have (on average 1.5533980582524272) internal successors, (160), 145 states have internal predecessors, (160), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2024-10-14 17:53:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 235 transitions. [2024-10-14 17:53:06,187 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 235 transitions. Word has length 24 [2024-10-14 17:53:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:06,187 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 235 transitions. [2024-10-14 17:53:06,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:53:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 235 transitions. [2024-10-14 17:53:06,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 17:53:06,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:06,188 INFO L215 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:06,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 17:53:06,388 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:53:06,389 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:06,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash 126305950, now seen corresponding path program 1 times [2024-10-14 17:53:06,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:06,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441570703] [2024-10-14 17:53:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:06,390 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:53:06,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:06,391 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:53:06,392 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:53:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:06,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 17:53:06,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:06,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-10-14 17:53:06,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 17:53:06,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 17:53:06,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 13 [2024-10-14 17:53:06,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 19 [2024-10-14 17:53:06,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 19 [2024-10-14 17:53:06,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 13 [2024-10-14 17:53:06,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 17:53:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 17:53:07,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:53:07,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:07,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441570703] [2024-10-14 17:53:07,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441570703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:53:07,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:53:07,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:53:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191618321] [2024-10-14 17:53:07,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:53:07,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:53:07,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:53:07,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:53:07,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:53:07,002 INFO L87 Difference]: Start difference. First operand 188 states and 235 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:53:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:07,797 INFO L93 Difference]: Finished difference Result 187 states and 234 transitions. [2024-10-14 17:53:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:53:07,798 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-14 17:53:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:07,799 INFO L225 Difference]: With dead ends: 187 [2024-10-14 17:53:07,799 INFO L226 Difference]: Without dead ends: 187 [2024-10-14 17:53:07,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:53:07,800 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 12 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:07,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1046 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 17:53:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-14 17:53:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-10-14 17:53:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 144 states have internal predecessors, (159), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2024-10-14 17:53:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 234 transitions. [2024-10-14 17:53:07,808 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 234 transitions. Word has length 24 [2024-10-14 17:53:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:07,808 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 234 transitions. [2024-10-14 17:53:07,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:53:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 234 transitions. [2024-10-14 17:53:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 17:53:07,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:07,810 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:07,818 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 (13)] Forceful destruction successful, exit code 0 [2024-10-14 17:53:08,010 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:53:08,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:08,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:08,011 INFO L85 PathProgramCache]: Analyzing trace with hash -741180313, now seen corresponding path program 1 times [2024-10-14 17:53:08,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:08,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658992168] [2024-10-14 17:53:08,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:08,012 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:53:08,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:08,013 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:53:08,014 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:53:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:08,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 17:53:08,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:08,288 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:53:08,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 17:53:08,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 17:53:08,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 17:53:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 17:53:08,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:53:08,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658992168] [2024-10-14 17:53:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658992168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:53:08,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:53:08,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:53:08,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280221736] [2024-10-14 17:53:08,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:53:08,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:53:08,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:53:08,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:53:08,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:53:08,386 INFO L87 Difference]: Start difference. First operand 187 states and 234 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:53:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:09,011 INFO L93 Difference]: Finished difference Result 190 states and 233 transitions. [2024-10-14 17:53:09,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:53:09,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-10-14 17:53:09,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:09,014 INFO L225 Difference]: With dead ends: 190 [2024-10-14 17:53:09,014 INFO L226 Difference]: Without dead ends: 187 [2024-10-14 17:53:09,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:53:09,015 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 18 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:09,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 874 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 17:53:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-14 17:53:09,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2024-10-14 17:53:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 101 states have (on average 1.4851485148514851) internal successors, (150), 141 states have internal predecessors, (150), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 17:53:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 220 transitions. [2024-10-14 17:53:09,021 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 220 transitions. Word has length 33 [2024-10-14 17:53:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:09,021 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 220 transitions. [2024-10-14 17:53:09,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:53:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2024-10-14 17:53:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 17:53:09,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:09,023 INFO L215 NwaCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:09,031 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:53:09,223 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:53:09,223 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:09,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash 414938964, now seen corresponding path program 1 times [2024-10-14 17:53:09,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:09,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967436843] [2024-10-14 17:53:09,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:09,225 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:53:09,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:09,226 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:53:09,228 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:53:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:09,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 17:53:09,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-14 17:53:09,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:53:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-14 17:53:10,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:10,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967436843] [2024-10-14 17:53:10,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967436843] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:53:10,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:53:10,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-14 17:53:10,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906567873] [2024-10-14 17:53:10,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:53:10,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 17:53:10,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:53:10,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 17:53:10,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:53:10,007 INFO L87 Difference]: Start difference. First operand 184 states and 220 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:53:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:11,488 INFO L93 Difference]: Finished difference Result 215 states and 274 transitions. [2024-10-14 17:53:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-14 17:53:11,489 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-10-14 17:53:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:11,490 INFO L225 Difference]: With dead ends: 215 [2024-10-14 17:53:11,490 INFO L226 Difference]: Without dead ends: 209 [2024-10-14 17:53:11,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=499, Invalid=1223, Unknown=0, NotChecked=0, Total=1722 [2024-10-14 17:53:11,492 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 102 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:11,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1661 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 17:53:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-14 17:53:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 191. [2024-10-14 17:53:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 108 states have (on average 1.4537037037037037) internal successors, (157), 148 states have internal predecessors, (157), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 17:53:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2024-10-14 17:53:11,500 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 44 [2024-10-14 17:53:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:11,501 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2024-10-14 17:53:11,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:53:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2024-10-14 17:53:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 17:53:11,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:11,503 INFO L215 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:11,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-14 17:53:11,703 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:53:11,704 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 358888326, now seen corresponding path program 2 times [2024-10-14 17:53:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:11,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777693226] [2024-10-14 17:53:11,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:53:11,705 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:53:11,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:11,706 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:53:11,707 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:53:11,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:53:11,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:53:11,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:53:11,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-14 17:53:11,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:53:11,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:11,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777693226] [2024-10-14 17:53:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777693226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:53:11,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:53:11,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:53:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330925781] [2024-10-14 17:53:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:53:11,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:53:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:53:11,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:53:11,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:53:11,927 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:53:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:12,258 INFO L93 Difference]: Finished difference Result 189 states and 225 transitions. [2024-10-14 17:53:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:53:12,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2024-10-14 17:53:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:12,260 INFO L225 Difference]: With dead ends: 189 [2024-10-14 17:53:12,260 INFO L226 Difference]: Without dead ends: 189 [2024-10-14 17:53:12,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:53:12,260 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 8 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:12,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 622 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:53:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-14 17:53:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-10-14 17:53:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 146 states have internal predecessors, (155), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 17:53:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 225 transitions. [2024-10-14 17:53:12,267 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 225 transitions. Word has length 51 [2024-10-14 17:53:12,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:12,267 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 225 transitions. [2024-10-14 17:53:12,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:53:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 225 transitions. [2024-10-14 17:53:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 17:53:12,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:12,268 INFO L215 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:12,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-14 17:53:12,468 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:53:12,469 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:12,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash 358888327, now seen corresponding path program 1 times [2024-10-14 17:53:12,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:12,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448870716] [2024-10-14 17:53:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:12,470 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:53:12,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:12,471 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:53:12,472 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:53:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:12,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 17:53:12,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-14 17:53:12,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:53:12,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:12,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448870716] [2024-10-14 17:53:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448870716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:53:12,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:53:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:53:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477766916] [2024-10-14 17:53:12,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:53:12,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:53:12,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:53:12,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:53:12,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:53:12,931 INFO L87 Difference]: Start difference. First operand 189 states and 225 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:53:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:13,439 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2024-10-14 17:53:13,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:53:13,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2024-10-14 17:53:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:13,441 INFO L225 Difference]: With dead ends: 187 [2024-10-14 17:53:13,441 INFO L226 Difference]: Without dead ends: 187 [2024-10-14 17:53:13,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:53:13,442 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 8 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:13,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 781 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:53:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-14 17:53:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-10-14 17:53:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 144 states have internal predecessors, (153), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 17:53:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 223 transitions. [2024-10-14 17:53:13,452 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 223 transitions. Word has length 51 [2024-10-14 17:53:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:13,453 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 223 transitions. [2024-10-14 17:53:13,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:53:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2024-10-14 17:53:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 17:53:13,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:13,457 INFO L215 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:13,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-14 17:53:13,657 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:53:13,658 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:13,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:13,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1759363583, now seen corresponding path program 1 times [2024-10-14 17:53:13,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:13,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496880511] [2024-10-14 17:53:13,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:13,659 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:53:13,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:13,662 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:53:13,664 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:53:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:14,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 17:53:14,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:14,155 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:53:14,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:53:14,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 15 [2024-10-14 17:53:14,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 15 [2024-10-14 17:53:14,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 17:53:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-14 17:53:14,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:53:14,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:14,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496880511] [2024-10-14 17:53:14,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496880511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:53:14,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:53:14,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:53:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577903901] [2024-10-14 17:53:14,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:53:14,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:53:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:53:14,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:53:14,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:53:14,295 INFO L87 Difference]: Start difference. First operand 187 states and 223 transitions. Second operand has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:53:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:14,718 INFO L93 Difference]: Finished difference Result 189 states and 228 transitions. [2024-10-14 17:53:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:53:14,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2024-10-14 17:53:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:14,720 INFO L225 Difference]: With dead ends: 189 [2024-10-14 17:53:14,720 INFO L226 Difference]: Without dead ends: 189 [2024-10-14 17:53:14,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:53:14,721 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 7 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:14,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 800 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:53:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-14 17:53:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2024-10-14 17:53:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 143 states have internal predecessors, (152), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 17:53:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 222 transitions. [2024-10-14 17:53:14,738 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 222 transitions. Word has length 52 [2024-10-14 17:53:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:14,739 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 222 transitions. [2024-10-14 17:53:14,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:53:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 222 transitions. [2024-10-14 17:53:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 17:53:14,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:14,740 INFO L215 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:14,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-14 17:53:14,940 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:53:14,941 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:14,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:14,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1759363582, now seen corresponding path program 1 times [2024-10-14 17:53:14,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:14,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906150782] [2024-10-14 17:53:14,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:14,942 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:53:14,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:14,943 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:53:14,944 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:53:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:15,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 17:53:15,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:15,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-10-14 17:53:15,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:53:15,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:53:15,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2024-10-14 17:53:15,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 17 [2024-10-14 17:53:15,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2024-10-14 17:53:15,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 17 [2024-10-14 17:53:15,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 17:53:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-14 17:53:15,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:53:15,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:15,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906150782] [2024-10-14 17:53:15,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906150782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:53:15,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:53:15,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:53:15,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773927803] [2024-10-14 17:53:15,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:53:15,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:53:15,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:53:15,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:53:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:53:15,758 INFO L87 Difference]: Start difference. First operand 186 states and 222 transitions. Second operand has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:53:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:16,537 INFO L93 Difference]: Finished difference Result 188 states and 227 transitions. [2024-10-14 17:53:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:53:16,538 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2024-10-14 17:53:16,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:16,539 INFO L225 Difference]: With dead ends: 188 [2024-10-14 17:53:16,539 INFO L226 Difference]: Without dead ends: 188 [2024-10-14 17:53:16,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:53:16,539 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 12 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:16,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1004 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 17:53:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-14 17:53:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2024-10-14 17:53:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 108 states have (on average 1.3981481481481481) internal successors, (151), 142 states have internal predecessors, (151), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 17:53:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 221 transitions. [2024-10-14 17:53:16,546 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 221 transitions. Word has length 52 [2024-10-14 17:53:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:16,547 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 221 transitions. [2024-10-14 17:53:16,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:53:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2024-10-14 17:53:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 17:53:16,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:16,550 INFO L215 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:53:16,562 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:53:16,750 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:53:16,750 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:53:16,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash -545470244, now seen corresponding path program 1 times [2024-10-14 17:53:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:53:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649669447] [2024-10-14 17:53:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:16,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:53:16,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:53:16,752 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:53:16,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-14 17:53:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:17,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 17:53:17,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:17,343 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 1 [2024-10-14 17:53:17,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 17:53:17,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2024-10-14 17:53:17,609 INFO L349 Elim1Store]: treesize reduction 54, result has 18.2 percent of original size [2024-10-14 17:53:17,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 27 [2024-10-14 17:53:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 126 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-14 17:53:17,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:53:21,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:53:21,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649669447] [2024-10-14 17:53:21,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649669447] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:53:21,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [120574500] [2024-10-14 17:53:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:21,878 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 17:53:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 17:53:21,881 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 17:53:21,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-10-14 17:53:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:22,423 WARN L253 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 498 conjuncts are in the unsatisfiable core [2024-10-14 17:53:22,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:22,465 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 17:53:22,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2024-10-14 17:53:22,479 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 1 [2024-10-14 17:53:22,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-10-14 17:53:22,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 17:53:54,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-14 17:54:09,296 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:54:09,296 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:54:09,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:54:09,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 77 [2024-10-14 17:54:16,185 INFO L349 Elim1Store]: treesize reduction 64, result has 34.7 percent of original size [2024-10-14 17:54:16,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 45 [2024-10-14 17:54:16,278 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:54:16,284 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-14 17:54:16,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 1 [2024-10-14 17:54:16,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2024-10-14 17:54:16,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2024-10-14 17:54:16,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57