./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test14.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.graphml --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 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 01:58:01,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:58:01,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:58:01,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:58:01,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:58:01,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:58:01,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:58:01,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:58:01,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:58:01,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:58:01,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:58:01,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:58:01,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:58:01,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:58:01,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:58:01,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:58:01,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:58:01,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:58:01,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:58:01,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:58:01,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:58:01,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:58:01,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:58:01,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:58:01,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:58:01,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:58:01,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:58:01,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:58:01,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:58:01,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:58:01,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:58:01,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:58:01,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:58:01,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:58:01,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:58:01,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:58:01,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:58:01,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:58:01,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:58:01,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:58:01,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:58:01,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 01:58:01,922 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:58:01,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:58:01,923 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:58:01,923 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:58:01,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:58:01,924 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:58:01,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:58:01,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:58:01,925 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:58:01,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:58:01,925 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:58:01,925 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:58:01,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:58:01,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:58:01,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:58:01,926 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:58:01,926 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:58:01,926 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:58:01,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:58:01,926 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:58:01,927 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:58:01,927 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:58:01,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:58:01,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:58:01,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:58:01,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:58:01,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:58:01,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:58:01,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 01:58:01,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 01:58:01,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:58:01,928 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:58:01,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:58:01,929 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:58:01,929 INFO L138 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.graphml 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 -> 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 [2023-02-14 01:58:02,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:58:02,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:58:02,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:58:02,159 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:58:02,160 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:58:02,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2023-02-14 01:58:03,020 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:58:03,237 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:58:03,237 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2023-02-14 01:58:03,247 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8797764ee/a6282c6c08c447639102d85dbba77615/FLAGf74b92d5f [2023-02-14 01:58:03,256 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8797764ee/a6282c6c08c447639102d85dbba77615 [2023-02-14 01:58:03,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:58:03,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:58:03,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:58:03,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:58:03,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:58:03,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:58:03" (1/1) ... [2023-02-14 01:58:03,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2f378b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:03, skipping insertion in model container [2023-02-14 01:58:03,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:58:03" (1/1) ... [2023-02-14 01:58:03,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:58:03,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:58:03,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:58:03,579 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-14 01:58:03,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@586c1cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:03, skipping insertion in model container [2023-02-14 01:58:03,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:58:03,581 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-14 01:58:03,583 INFO L158 Benchmark]: Toolchain (without parser) took 323.00ms. Allocated memory is still 136.3MB. Free memory was 102.8MB in the beginning and 89.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-14 01:58:03,583 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 136.3MB. Free memory was 108.8MB in the beginning and 108.6MB in the end (delta: 209.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 01:58:03,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.37ms. Allocated memory is still 136.3MB. Free memory was 102.8MB in the beginning and 89.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-14 01:58:03,585 INFO L339 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 136.3MB. Free memory was 108.8MB in the beginning and 108.6MB in the end (delta: 209.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.37ms. Allocated memory is still 136.3MB. Free memory was 102.8MB in the beginning and 89.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: 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: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test14.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.graphml --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 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 01:58:05,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:58:05,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:58:05,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:58:05,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:58:05,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:58:05,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:58:05,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:58:05,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:58:05,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:58:05,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:58:05,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:58:05,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:58:05,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:58:05,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:58:05,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:58:05,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:58:05,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:58:05,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:58:05,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:58:05,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:58:05,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:58:05,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:58:05,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:58:05,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:58:05,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:58:05,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:58:05,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:58:05,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:58:05,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:58:05,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:58:05,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:58:05,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:58:05,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:58:05,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:58:05,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:58:05,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:58:05,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:58:05,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:58:05,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:58:05,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:58:05,198 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-14 01:58:05,222 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:58:05,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:58:05,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:58:05,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:58:05,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:58:05,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:58:05,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:58:05,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:58:05,225 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:58:05,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:58:05,226 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:58:05,226 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:58:05,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:58:05,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:58:05,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:58:05,227 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:58:05,227 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:58:05,227 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:58:05,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:58:05,227 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:58:05,227 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-14 01:58:05,227 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-14 01:58:05,228 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:58:05,228 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:58:05,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:58:05,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:58:05,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:58:05,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:58:05,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:58:05,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:58:05,229 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-14 01:58:05,229 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-14 01:58:05,229 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:58:05,229 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:58:05,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:58:05,230 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-14 01:58:05,230 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:58:05,230 INFO L138 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.graphml 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 -> 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 [2023-02-14 01:58:05,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:58:05,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:58:05,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:58:05,499 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:58:05,499 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:58:05,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2023-02-14 01:58:06,460 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:58:06,731 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:58:06,732 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2023-02-14 01:58:06,741 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/434e28cac/0f2da15da18b4e468bdce2f980dc5751/FLAGc675b7629 [2023-02-14 01:58:06,756 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/434e28cac/0f2da15da18b4e468bdce2f980dc5751 [2023-02-14 01:58:06,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:58:06,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:58:06,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:58:06,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:58:06,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:58:06,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:58:06" (1/1) ... [2023-02-14 01:58:06,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48bef1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:06, skipping insertion in model container [2023-02-14 01:58:06,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:58:06" (1/1) ... [2023-02-14 01:58:06,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:58:06,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:58:07,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:58:07,058 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-14 01:58:07,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:58:07,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:58:07,128 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 01:58:07,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:58:07,197 INFO L208 MainTranslator]: Completed translation [2023-02-14 01:58:07,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07 WrapperNode [2023-02-14 01:58:07,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:58:07,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 01:58:07,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 01:58:07,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 01:58:07,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07" (1/1) ... [2023-02-14 01:58:07,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07" (1/1) ... [2023-02-14 01:58:07,245 INFO L138 Inliner]: procedures = 168, calls = 80, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 59 [2023-02-14 01:58:07,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 01:58:07,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 01:58:07,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 01:58:07,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 01:58:07,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07" (1/1) ... [2023-02-14 01:58:07,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07" (1/1) ... [2023-02-14 01:58:07,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07" (1/1) ... [2023-02-14 01:58:07,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07" (1/1) ... [2023-02-14 01:58:07,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07" (1/1) ... [2023-02-14 01:58:07,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07" (1/1) ... [2023-02-14 01:58:07,271 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07" (1/1) ... [2023-02-14 01:58:07,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07" (1/1) ... [2023-02-14 01:58:07,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 01:58:07,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 01:58:07,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 01:58:07,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 01:58:07,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07" (1/1) ... [2023-02-14 01:58:07,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:58:07,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:58:07,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 01:58:07,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 01:58:07,326 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-14 01:58:07,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-14 01:58:07,326 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-14 01:58:07,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-14 01:58:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2023-02-14 01:58:07,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2023-02-14 01:58:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 01:58:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 01:58:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 01:58:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 01:58:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 01:58:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 01:58:07,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 01:58:07,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2023-02-14 01:58:07,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2023-02-14 01:58:07,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 01:58:07,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 01:58:07,414 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 01:58:07,416 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 01:58:07,707 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 01:58:07,711 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 01:58:07,712 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 01:58:07,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:58:07 BoogieIcfgContainer [2023-02-14 01:58:07,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 01:58:07,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 01:58:07,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 01:58:07,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 01:58:07,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:58:06" (1/3) ... [2023-02-14 01:58:07,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca94ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:58:07, skipping insertion in model container [2023-02-14 01:58:07,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:58:07" (2/3) ... [2023-02-14 01:58:07,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca94ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:58:07, skipping insertion in model container [2023-02-14 01:58:07,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:58:07" (3/3) ... [2023-02-14 01:58:07,720 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test14.i [2023-02-14 01:58:07,732 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 01:58:07,732 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-02-14 01:58:07,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 01:58:07,784 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@527b55c3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 01:58:07,784 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-02-14 01:58:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 70 states have internal predecessors, (73), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:58:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 01:58:07,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:07,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:07,797 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:58:07,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:07,802 INFO L85 PathProgramCache]: Analyzing trace with hash -781473750, now seen corresponding path program 1 times [2023-02-14 01:58:07,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:07,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794775037] [2023-02-14 01:58:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:07,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:07,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:07,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:58:07,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-14 01:58:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:07,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 01:58:07,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:08,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:58:08,038 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2023-02-14 01:58:08,067 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:58:08,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 01:58:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:08,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:08,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:08,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794775037] [2023-02-14 01:58:08,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794775037] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:08,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:08,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:58:08,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530377110] [2023-02-14 01:58:08,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:08,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:58:08,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:08,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:58:08,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-02-14 01:58:08,138 INFO L87 Difference]: Start difference. First operand has 78 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 70 states have internal predecessors, (73), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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) [2023-02-14 01:58:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:08,421 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2023-02-14 01:58:08,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:58:08,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 12 [2023-02-14 01:58:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:08,428 INFO L225 Difference]: With dead ends: 88 [2023-02-14 01:58:08,428 INFO L226 Difference]: Without dead ends: 86 [2023-02-14 01:58:08,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2023-02-14 01:58:08,431 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:08,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 110 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 219 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2023-02-14 01:58:08,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-14 01:58:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2023-02-14 01:58:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 40 states have (on average 1.725) internal successors, (69), 67 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:58:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2023-02-14 01:58:08,458 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 12 [2023-02-14 01:58:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:08,459 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2023-02-14 01:58:08,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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) [2023-02-14 01:58:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2023-02-14 01:58:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 01:58:08,460 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:08,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:08,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:08,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:08,668 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:58:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash -781473749, now seen corresponding path program 1 times [2023-02-14 01:58:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:08,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916868293] [2023-02-14 01:58:08,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:08,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:08,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:08,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:58:08,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-14 01:58:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:08,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 01:58:08,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:08,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:58:08,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:58:08,837 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_13 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_13))))) is different from true [2023-02-14 01:58:08,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:58:08,872 INFO L350 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 12 treesize of output 14 [2023-02-14 01:58:08,882 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:58:08,883 INFO L350 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 [2023-02-14 01:58:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:08,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:08,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916868293] [2023-02-14 01:58:08,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916868293] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:08,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:08,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 01:58:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118526429] [2023-02-14 01:58:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:08,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:58:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:08,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:58:08,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-14 01:58:08,938 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 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) [2023-02-14 01:58:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:09,279 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2023-02-14 01:58:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:58:09,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 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 12 [2023-02-14 01:58:09,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:09,281 INFO L225 Difference]: With dead ends: 97 [2023-02-14 01:58:09,281 INFO L226 Difference]: Without dead ends: 97 [2023-02-14 01:58:09,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2023-02-14 01:58:09,282 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 88 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:09,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 164 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 263 Invalid, 0 Unknown, 105 Unchecked, 0.3s Time] [2023-02-14 01:58:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-14 01:58:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2023-02-14 01:58:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.7) internal successors, (68), 66 states have internal predecessors, (68), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:58:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2023-02-14 01:58:09,287 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 12 [2023-02-14 01:58:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:09,288 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2023-02-14 01:58:09,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 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) [2023-02-14 01:58:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2023-02-14 01:58:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 01:58:09,288 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:09,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:09,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:09,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:09,495 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:58:09,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1410681567, now seen corresponding path program 1 times [2023-02-14 01:58:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:09,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983764097] [2023-02-14 01:58:09,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:09,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:09,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:09,499 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:58:09,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-14 01:58:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:09,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:58:09,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:09,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:09,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:09,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983764097] [2023-02-14 01:58:09,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983764097] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:09,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:09,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:58:09,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913328588] [2023-02-14 01:58:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:09,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:58:09,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:09,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:58:09,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:58:09,563 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-02-14 01:58:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:09,584 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2023-02-14 01:58:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:58:09,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2023-02-14 01:58:09,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:09,591 INFO L225 Difference]: With dead ends: 105 [2023-02-14 01:58:09,591 INFO L226 Difference]: Without dead ends: 105 [2023-02-14 01:58:09,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:58:09,592 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 26 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:09,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 372 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:58:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-14 01:58:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 78. [2023-02-14 01:58:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 69 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-14 01:58:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2023-02-14 01:58:09,601 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 11 [2023-02-14 01:58:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:09,601 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2023-02-14 01:58:09,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-02-14 01:58:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2023-02-14 01:58:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 01:58:09,602 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:09,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:09,610 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 [2023-02-14 01:58:09,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:09,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:58:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash -523177886, now seen corresponding path program 1 times [2023-02-14 01:58:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:09,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892687409] [2023-02-14 01:58:09,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:09,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:09,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:09,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:58:09,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-14 01:58:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:09,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:58:09,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:09,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:58:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:09,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:09,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:09,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892687409] [2023-02-14 01:58:09,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892687409] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:09,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:09,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:58:09,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117552996] [2023-02-14 01:58:09,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:09,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:58:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:09,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:58:09,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:58:09,910 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2023-02-14 01:58:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:10,109 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2023-02-14 01:58:10,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:58:10,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2023-02-14 01:58:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:10,110 INFO L225 Difference]: With dead ends: 105 [2023-02-14 01:58:10,110 INFO L226 Difference]: Without dead ends: 105 [2023-02-14 01:58:10,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:58:10,111 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 77 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:10,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 93 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:58:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-14 01:58:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 81. [2023-02-14 01:58:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2023-02-14 01:58:10,115 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 11 [2023-02-14 01:58:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:10,115 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2023-02-14 01:58:10,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2023-02-14 01:58:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2023-02-14 01:58:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 01:58:10,116 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:10,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:10,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:10,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:10,323 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:58:10,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:10,323 INFO L85 PathProgramCache]: Analyzing trace with hash -523177885, now seen corresponding path program 1 times [2023-02-14 01:58:10,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:10,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342128930] [2023-02-14 01:58:10,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:10,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:10,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:10,325 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:58:10,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-14 01:58:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:10,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:58:10,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:10,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:58:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:10,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:10,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:10,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342128930] [2023-02-14 01:58:10,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342128930] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:10,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:10,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:58:10,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133056189] [2023-02-14 01:58:10,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:10,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:58:10,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:10,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:58:10,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:58:10,417 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2023-02-14 01:58:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:10,654 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2023-02-14 01:58:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:58:10,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2023-02-14 01:58:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:10,655 INFO L225 Difference]: With dead ends: 103 [2023-02-14 01:58:10,655 INFO L226 Difference]: Without dead ends: 103 [2023-02-14 01:58:10,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:58:10,656 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 78 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:10,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 106 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:58:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-14 01:58:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 81. [2023-02-14 01:58:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2023-02-14 01:58:10,660 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 11 [2023-02-14 01:58:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:10,660 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2023-02-14 01:58:10,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2023-02-14 01:58:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2023-02-14 01:58:10,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 01:58:10,660 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:10,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:10,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:10,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:10,867 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:58:10,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2133290457, now seen corresponding path program 1 times [2023-02-14 01:58:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:10,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101820183] [2023-02-14 01:58:10,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:10,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:10,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:10,870 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:58:10,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-14 01:58:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:10,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-14 01:58:10,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:12,935 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|) |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|)) is different from true [2023-02-14 01:58:12,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:58:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:13,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:13,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:13,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101820183] [2023-02-14 01:58:13,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101820183] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:13,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:13,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 01:58:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258690718] [2023-02-14 01:58:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:13,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 01:58:13,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:13,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 01:58:13,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=44, Unknown=1, NotChecked=12, Total=72 [2023-02-14 01:58:13,016 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:13,231 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2023-02-14 01:58:13,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 01:58:13,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-14 01:58:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:13,232 INFO L225 Difference]: With dead ends: 99 [2023-02-14 01:58:13,232 INFO L226 Difference]: Without dead ends: 99 [2023-02-14 01:58:13,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2023-02-14 01:58:13,233 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 38 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:13,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 318 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 109 Unchecked, 0.2s Time] [2023-02-14 01:58:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-14 01:58:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2023-02-14 01:58:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 79 states have internal predecessors, (88), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 01:58:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2023-02-14 01:58:13,237 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 15 [2023-02-14 01:58:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:13,237 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2023-02-14 01:58:13,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2023-02-14 01:58:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 01:58:13,238 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:13,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:13,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:13,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:13,445 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:58:13,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:13,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2133290458, now seen corresponding path program 1 times [2023-02-14 01:58:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:13,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901231774] [2023-02-14 01:58:13,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:13,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:13,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:13,447 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:58:13,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-14 01:58:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:13,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-14 01:58:13,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:13,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:58:13,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:58:13,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-14 01:58:13,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 01:58:13,578 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)) |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|))) (exists ((v_ArrVal_34 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_34) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|))))) is different from true [2023-02-14 01:58:13,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:58:13,610 INFO L350 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 12 treesize of output 14 [2023-02-14 01:58:13,619 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:58:13,619 INFO L350 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 [2023-02-14 01:58:13,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:58:13,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:58:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:13,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:13,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:13,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901231774] [2023-02-14 01:58:13,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901231774] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:13,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:13,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 01:58:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050025958] [2023-02-14 01:58:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:13,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 01:58:13,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:13,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 01:58:13,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2023-02-14 01:58:13,755 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:14,413 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2023-02-14 01:58:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 01:58:14,414 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-14 01:58:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:14,414 INFO L225 Difference]: With dead ends: 114 [2023-02-14 01:58:14,414 INFO L226 Difference]: Without dead ends: 114 [2023-02-14 01:58:14,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=190, Unknown=1, NotChecked=28, Total=272 [2023-02-14 01:58:14,415 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 61 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:14,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 284 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 376 Invalid, 0 Unknown, 101 Unchecked, 0.4s Time] [2023-02-14 01:58:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-14 01:58:14,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2023-02-14 01:58:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 78 states have internal predecessors, (86), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 01:58:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2023-02-14 01:58:14,419 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 15 [2023-02-14 01:58:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:14,423 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2023-02-14 01:58:14,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2023-02-14 01:58:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 01:58:14,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:14,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:14,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:14,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:14,625 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:58:14,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 336339098, now seen corresponding path program 1 times [2023-02-14 01:58:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:14,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894651187] [2023-02-14 01:58:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:14,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:14,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:14,626 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:58:14,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-14 01:58:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:14,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:58:14,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:14,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:14,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:14,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894651187] [2023-02-14 01:58:14,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894651187] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:14,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:14,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:58:14,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544161271] [2023-02-14 01:58:14,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:14,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:58:14,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:14,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:58:14,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:58:14,711 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:14,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:14,727 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2023-02-14 01:58:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:58:14,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-14 01:58:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:14,729 INFO L225 Difference]: With dead ends: 100 [2023-02-14 01:58:14,729 INFO L226 Difference]: Without dead ends: 100 [2023-02-14 01:58:14,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:58:14,730 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 24 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:14,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 292 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:58:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-14 01:58:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2023-02-14 01:58:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 68 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-14 01:58:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2023-02-14 01:58:14,743 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 15 [2023-02-14 01:58:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:14,743 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2023-02-14 01:58:14,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2023-02-14 01:58:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 01:58:14,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:14,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:14,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:14,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:14,952 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:58:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash -262774844, now seen corresponding path program 1 times [2023-02-14 01:58:14,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:14,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281980104] [2023-02-14 01:58:14,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:14,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:14,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:14,953 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:58:14,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-14 01:58:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:14,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 01:58:15,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:15,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:58:15,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 01:58:15,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:58:15,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:58:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:15,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:15,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:15,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281980104] [2023-02-14 01:58:15,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281980104] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:15,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:15,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:58:15,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536367983] [2023-02-14 01:58:15,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:15,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:58:15,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:15,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:58:15,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:58:15,177 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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) [2023-02-14 01:58:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:15,582 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2023-02-14 01:58:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:58:15,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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 13 [2023-02-14 01:58:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:15,583 INFO L225 Difference]: With dead ends: 101 [2023-02-14 01:58:15,584 INFO L226 Difference]: Without dead ends: 101 [2023-02-14 01:58:15,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:58:15,584 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 37 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:15,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 220 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:58:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-14 01:58:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 84. [2023-02-14 01:58:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.54) internal successors, (77), 73 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2023-02-14 01:58:15,587 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 13 [2023-02-14 01:58:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:15,587 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2023-02-14 01:58:15,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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) [2023-02-14 01:58:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2023-02-14 01:58:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 01:58:15,587 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:15,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:15,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:15,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:15,793 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:58:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash -262774845, now seen corresponding path program 1 times [2023-02-14 01:58:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:15,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574410081] [2023-02-14 01:58:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:15,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:15,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:15,795 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:58:15,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-14 01:58:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:15,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 01:58:15,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:15,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:58:15,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-14 01:58:17,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:58:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:17,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:17,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:17,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574410081] [2023-02-14 01:58:17,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574410081] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:17,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:17,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:58:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466238007] [2023-02-14 01:58:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:17,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:58:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:17,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:58:17,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:58:17,928 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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) [2023-02-14 01:58:19,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:21,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:24,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:26,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:28,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:30,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:32,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:34,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:36,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:38,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:40,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:42,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:44,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:46,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:48,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:50,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:52,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:54,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:56,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:58,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:00,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:02,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:04,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:06,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:08,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:10,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:10,403 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2023-02-14 01:59:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:59:10,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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 13 [2023-02-14 01:59:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:10,404 INFO L225 Difference]: With dead ends: 104 [2023-02-14 01:59:10,404 INFO L226 Difference]: Without dead ends: 104 [2023-02-14 01:59:10,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:59:10,405 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 34 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 4 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:10,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 202 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 234 Invalid, 26 Unknown, 0 Unchecked, 52.4s Time] [2023-02-14 01:59:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-14 01:59:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2023-02-14 01:59:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.537037037037037) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 01:59:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2023-02-14 01:59:10,407 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 13 [2023-02-14 01:59:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:10,407 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2023-02-14 01:59:10,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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) [2023-02-14 01:59:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2023-02-14 01:59:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:59:10,408 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:10,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:10,417 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 [2023-02-14 01:59:10,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:10,615 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:10,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:10,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1707494783, now seen corresponding path program 1 times [2023-02-14 01:59:10,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:10,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123454588] [2023-02-14 01:59:10,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:10,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:10,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:10,617 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:10,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-14 01:59:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:10,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:59:10,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:10,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:59:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:10,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:10,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:10,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123454588] [2023-02-14 01:59:10,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123454588] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:10,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:10,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 01:59:10,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337127184] [2023-02-14 01:59:10,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:10,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 01:59:10,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:10,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 01:59:10,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:59:10,728 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:59:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:10,992 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2023-02-14 01:59:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:59:10,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-14 01:59:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:10,993 INFO L225 Difference]: With dead ends: 90 [2023-02-14 01:59:10,993 INFO L226 Difference]: Without dead ends: 90 [2023-02-14 01:59:10,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:59:10,994 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 39 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:10,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 326 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:59:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-14 01:59:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2023-02-14 01:59:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.5) internal successors, (81), 75 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 01:59:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2023-02-14 01:59:10,996 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 16 [2023-02-14 01:59:10,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:10,997 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2023-02-14 01:59:10,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:59:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2023-02-14 01:59:10,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:59:10,997 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:10,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:11,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:11,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:11,207 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1707494784, now seen corresponding path program 1 times [2023-02-14 01:59:11,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:11,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622628563] [2023-02-14 01:59:11,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:11,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:11,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:11,208 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:11,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-14 01:59:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:11,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 01:59:11,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:11,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:59:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:11,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:11,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622628563] [2023-02-14 01:59:11,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622628563] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:11,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:11,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-14 01:59:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102161866] [2023-02-14 01:59:11,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:11,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:59:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:11,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:59:11,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:59:11,371 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:59:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:11,659 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2023-02-14 01:59:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:59:11,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-14 01:59:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:11,660 INFO L225 Difference]: With dead ends: 90 [2023-02-14 01:59:11,660 INFO L226 Difference]: Without dead ends: 90 [2023-02-14 01:59:11,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:59:11,660 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:11,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 418 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:59:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-14 01:59:11,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2023-02-14 01:59:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 73 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 01:59:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-02-14 01:59:11,663 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2023-02-14 01:59:11,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:11,663 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-02-14 01:59:11,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:59:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-02-14 01:59:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 01:59:11,663 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:11,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:11,673 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 [2023-02-14 01:59:11,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:11,864 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:11,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash 224981282, now seen corresponding path program 1 times [2023-02-14 01:59:11,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:11,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403226483] [2023-02-14 01:59:11,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:11,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:11,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:11,867 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:11,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-14 01:59:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:11,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:59:11,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:11,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:11,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:11,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403226483] [2023-02-14 01:59:11,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403226483] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:11,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:11,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:59:11,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708905981] [2023-02-14 01:59:11,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:11,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:59:11,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:11,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:59:11,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:59:11,974 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:59:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:12,073 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2023-02-14 01:59:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:59:12,073 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-14 01:59:12,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:12,074 INFO L225 Difference]: With dead ends: 84 [2023-02-14 01:59:12,074 INFO L226 Difference]: Without dead ends: 84 [2023-02-14 01:59:12,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:59:12,074 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:12,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 171 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:59:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-14 01:59:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-14 01:59:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 01:59:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2023-02-14 01:59:12,077 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 18 [2023-02-14 01:59:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:12,077 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2023-02-14 01:59:12,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:59:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2023-02-14 01:59:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 01:59:12,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:12,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:12,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:12,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:12,287 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:12,287 INFO L85 PathProgramCache]: Analyzing trace with hash 224981283, now seen corresponding path program 1 times [2023-02-14 01:59:12,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:12,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882879234] [2023-02-14 01:59:12,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:12,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:12,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:12,289 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:12,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-14 01:59:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:12,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 01:59:12,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:12,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:12,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:12,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882879234] [2023-02-14 01:59:12,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882879234] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:12,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:12,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 01:59:12,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491128881] [2023-02-14 01:59:12,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:12,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:59:12,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:12,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:59:12,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:59:12,441 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:59:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:12,639 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2023-02-14 01:59:12,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:59:12,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-14 01:59:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:12,640 INFO L225 Difference]: With dead ends: 83 [2023-02-14 01:59:12,640 INFO L226 Difference]: Without dead ends: 83 [2023-02-14 01:59:12,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:59:12,641 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 40 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:12,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 311 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:59:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-14 01:59:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-14 01:59:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 71 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 01:59:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2023-02-14 01:59:12,643 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 18 [2023-02-14 01:59:12,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:12,643 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2023-02-14 01:59:12,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:59:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2023-02-14 01:59:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 01:59:12,644 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:12,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:12,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:12,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:12,852 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:12,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1052662622, now seen corresponding path program 1 times [2023-02-14 01:59:12,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:12,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055436571] [2023-02-14 01:59:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:12,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:12,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:12,854 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:12,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-14 01:59:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:12,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 01:59:12,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:13,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:59:13,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2023-02-14 01:59:13,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:59:13,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2023-02-14 01:59:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:13,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:13,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:13,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055436571] [2023-02-14 01:59:13,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055436571] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:13,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:13,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 01:59:13,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062943868] [2023-02-14 01:59:13,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:13,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:59:13,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:13,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:59:13,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:59:13,064 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 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) [2023-02-14 01:59:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:13,294 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2023-02-14 01:59:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:59:13,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 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 18 [2023-02-14 01:59:13,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:13,295 INFO L225 Difference]: With dead ends: 85 [2023-02-14 01:59:13,295 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 01:59:13,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:59:13,301 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:13,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 289 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:59:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 01:59:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2023-02-14 01:59:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 70 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:59:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-14 01:59:13,303 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 18 [2023-02-14 01:59:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:13,303 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-14 01:59:13,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 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) [2023-02-14 01:59:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-14 01:59:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 01:59:13,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:13,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:13,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:13,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:13,504 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:13,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:13,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1052560596, now seen corresponding path program 1 times [2023-02-14 01:59:13,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:13,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084939366] [2023-02-14 01:59:13,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:13,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:13,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:13,506 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:13,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-14 01:59:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:13,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 01:59:13,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:13,615 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6|)))) is different from true [2023-02-14 01:59:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:13,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:13,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:13,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084939366] [2023-02-14 01:59:13,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084939366] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:13,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:13,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:59:13,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628386441] [2023-02-14 01:59:13,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:13,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:59:13,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:13,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:59:13,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-14 01:59:13,623 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-02-14 01:59:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:13,765 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2023-02-14 01:59:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:59:13,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 18 [2023-02-14 01:59:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:13,766 INFO L225 Difference]: With dead ends: 84 [2023-02-14 01:59:13,766 INFO L226 Difference]: Without dead ends: 71 [2023-02-14 01:59:13,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-14 01:59:13,766 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:13,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 79 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 79 Unchecked, 0.1s Time] [2023-02-14 01:59:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-14 01:59:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-02-14 01:59:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 61 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:59:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2023-02-14 01:59:13,768 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 18 [2023-02-14 01:59:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:13,768 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2023-02-14 01:59:13,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-02-14 01:59:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2023-02-14 01:59:13,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 01:59:13,769 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:13,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:13,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:13,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:13,976 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:13,976 INFO L85 PathProgramCache]: Analyzing trace with hash 874346275, now seen corresponding path program 1 times [2023-02-14 01:59:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:13,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25900104] [2023-02-14 01:59:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:13,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:13,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:13,978 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:13,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-14 01:59:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:14,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 01:59:14,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:14,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:14,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:14,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25900104] [2023-02-14 01:59:14,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25900104] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:14,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:14,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 01:59:14,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952508350] [2023-02-14 01:59:14,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:14,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:59:14,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:14,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:59:14,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:59:14,131 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 01:59:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:14,350 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2023-02-14 01:59:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:59:14,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-02-14 01:59:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:14,351 INFO L225 Difference]: With dead ends: 73 [2023-02-14 01:59:14,351 INFO L226 Difference]: Without dead ends: 73 [2023-02-14 01:59:14,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:59:14,351 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 90 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:14,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 166 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:59:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-14 01:59:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-14 01:59:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 60 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:59:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2023-02-14 01:59:14,353 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 25 [2023-02-14 01:59:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:14,353 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2023-02-14 01:59:14,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 01:59:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2023-02-14 01:59:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 01:59:14,354 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:14,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:14,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:14,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:14,555 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:14,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:14,555 INFO L85 PathProgramCache]: Analyzing trace with hash 874346276, now seen corresponding path program 1 times [2023-02-14 01:59:14,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:14,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30689804] [2023-02-14 01:59:14,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:14,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:14,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:14,557 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:14,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-14 01:59:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:14,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 01:59:14,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:14,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:14,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:14,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30689804] [2023-02-14 01:59:14,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30689804] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:14,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:14,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:59:14,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038677007] [2023-02-14 01:59:14,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:14,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:59:14,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:14,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:59:14,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:59:14,728 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 01:59:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:14,953 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2023-02-14 01:59:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:59:14,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-02-14 01:59:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:14,954 INFO L225 Difference]: With dead ends: 69 [2023-02-14 01:59:14,954 INFO L226 Difference]: Without dead ends: 69 [2023-02-14 01:59:14,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:59:14,955 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 65 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:14,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 200 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:59:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-14 01:59:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-02-14 01:59:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 59 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:59:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2023-02-14 01:59:14,957 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 25 [2023-02-14 01:59:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:14,957 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2023-02-14 01:59:14,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 01:59:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2023-02-14 01:59:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 01:59:14,957 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:14,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:14,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:15,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:15,158 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:15,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1566819771, now seen corresponding path program 1 times [2023-02-14 01:59:15,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:15,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807334042] [2023-02-14 01:59:15,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:15,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:15,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:15,160 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:15,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-14 01:59:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:15,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 01:59:15,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:15,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:59:15,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:59:15,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:59:15,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:59:15,618 INFO L350 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 [2023-02-14 01:59:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:15,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:15,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:15,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807334042] [2023-02-14 01:59:15,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807334042] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:15,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:15,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-02-14 01:59:15,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218497924] [2023-02-14 01:59:15,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:15,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-14 01:59:15,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 01:59:15,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-14 01:59:15,676 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:59:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:16,599 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2023-02-14 01:59:16,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 01:59:16,600 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2023-02-14 01:59:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:16,600 INFO L225 Difference]: With dead ends: 74 [2023-02-14 01:59:16,600 INFO L226 Difference]: Without dead ends: 74 [2023-02-14 01:59:16,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2023-02-14 01:59:16,601 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 81 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:16,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 303 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:59:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-14 01:59:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2023-02-14 01:59:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 58 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:59:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2023-02-14 01:59:16,603 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 27 [2023-02-14 01:59:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:16,603 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2023-02-14 01:59:16,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:59:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2023-02-14 01:59:16,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 01:59:16,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:16,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:16,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:16,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:16,804 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:16,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:16,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1566819772, now seen corresponding path program 1 times [2023-02-14 01:59:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:16,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459600473] [2023-02-14 01:59:16,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:16,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:16,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:16,806 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:16,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-14 01:59:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:16,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-14 01:59:16,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:16,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:59:17,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:59:17,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-14 01:59:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:17,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:17,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:17,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459600473] [2023-02-14 01:59:17,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459600473] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:17,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:17,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-14 01:59:17,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723594662] [2023-02-14 01:59:17,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:17,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-14 01:59:17,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:17,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-14 01:59:17,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-14 01:59:17,157 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:59:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:17,816 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2023-02-14 01:59:17,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 01:59:17,816 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2023-02-14 01:59:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:17,817 INFO L225 Difference]: With dead ends: 69 [2023-02-14 01:59:17,817 INFO L226 Difference]: Without dead ends: 69 [2023-02-14 01:59:17,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2023-02-14 01:59:17,818 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 82 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:17,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 238 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 01:59:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-14 01:59:17,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2023-02-14 01:59:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 57 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:59:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2023-02-14 01:59:17,820 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 27 [2023-02-14 01:59:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:17,820 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2023-02-14 01:59:17,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:59:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2023-02-14 01:59:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 01:59:17,821 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:17,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:17,829 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 (21)] Ended with exit code 0 [2023-02-14 01:59:18,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:18,028 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash 204597629, now seen corresponding path program 1 times [2023-02-14 01:59:18,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:18,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721787824] [2023-02-14 01:59:18,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:18,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:18,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:18,030 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:18,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-14 01:59:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:18,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-14 01:59:18,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:18,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:59:18,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:59:18,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-14 01:59:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:18,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:18,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:18,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721787824] [2023-02-14 01:59:18,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721787824] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:18,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:18,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-14 01:59:18,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202209464] [2023-02-14 01:59:18,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:18,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 01:59:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 01:59:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-02-14 01:59:18,425 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:59:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:19,287 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2023-02-14 01:59:19,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 01:59:19,288 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2023-02-14 01:59:19,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:19,288 INFO L225 Difference]: With dead ends: 83 [2023-02-14 01:59:19,288 INFO L226 Difference]: Without dead ends: 83 [2023-02-14 01:59:19,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2023-02-14 01:59:19,289 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 95 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:19,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 272 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 01:59:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-14 01:59:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2023-02-14 01:59:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 64 states have internal predecessors, (73), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:59:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2023-02-14 01:59:19,291 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 32 [2023-02-14 01:59:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:19,291 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2023-02-14 01:59:19,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:59:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2023-02-14 01:59:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 01:59:19,291 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:19,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:19,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:19,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:19,492 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash 204597630, now seen corresponding path program 1 times [2023-02-14 01:59:19,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:19,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463404867] [2023-02-14 01:59:19,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:19,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:19,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:19,494 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:19,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-14 01:59:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:19,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-14 01:59:19,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:19,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:59:19,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:59:19,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:59:19,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:59:19,925 INFO L350 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 [2023-02-14 01:59:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:20,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:20,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:20,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463404867] [2023-02-14 01:59:20,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463404867] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:20,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:20,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-14 01:59:20,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628184855] [2023-02-14 01:59:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:20,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 01:59:20,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:20,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 01:59:20,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-02-14 01:59:20,037 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:59:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:20,975 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2023-02-14 01:59:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 01:59:20,976 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2023-02-14 01:59:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:20,976 INFO L225 Difference]: With dead ends: 85 [2023-02-14 01:59:20,976 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 01:59:20,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2023-02-14 01:59:20,977 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 96 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:20,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 330 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:59:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 01:59:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2023-02-14 01:59:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 64 states have internal predecessors, (71), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:59:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2023-02-14 01:59:20,979 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 32 [2023-02-14 01:59:20,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:20,979 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2023-02-14 01:59:20,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:59:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2023-02-14 01:59:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 01:59:20,980 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:20,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:20,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:21,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:21,188 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:21,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:21,188 INFO L85 PathProgramCache]: Analyzing trace with hash 204495603, now seen corresponding path program 1 times [2023-02-14 01:59:21,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:21,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918689694] [2023-02-14 01:59:21,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:21,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:21,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:21,190 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:21,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-14 01:59:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:21,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-14 01:59:21,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:21,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:59:21,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:59:21,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2023-02-14 01:59:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:21,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:21,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:21,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918689694] [2023-02-14 01:59:21,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918689694] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:21,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:21,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-14 01:59:21,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546735507] [2023-02-14 01:59:21,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:21,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 01:59:21,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:21,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 01:59:21,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-02-14 01:59:21,485 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:59:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:21,922 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-02-14 01:59:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 01:59:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2023-02-14 01:59:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:21,925 INFO L225 Difference]: With dead ends: 77 [2023-02-14 01:59:21,925 INFO L226 Difference]: Without dead ends: 77 [2023-02-14 01:59:21,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2023-02-14 01:59:21,925 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 68 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:21,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 418 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:59:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-14 01:59:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-02-14 01:59:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 64 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:59:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2023-02-14 01:59:21,929 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 32 [2023-02-14 01:59:21,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:21,929 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2023-02-14 01:59:21,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:59:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2023-02-14 01:59:21,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-14 01:59:21,930 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:21,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:21,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:22,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:22,151 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 01:59:22,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:22,151 INFO L85 PathProgramCache]: Analyzing trace with hash 609411339, now seen corresponding path program 1 times [2023-02-14 01:59:22,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:22,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660945794] [2023-02-14 01:59:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:22,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:22,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:22,153 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:22,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-14 01:59:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:22,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 62 conjunts are in the unsatisfiable core [2023-02-14 01:59:22,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:22,294 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-14 01:59:22,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-02-14 01:59:22,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:59:22,329 INFO L350 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 17 treesize of output 23 [2023-02-14 01:59:26,408 INFO L321 Elim1Store]: treesize reduction 16, result has 48.4 percent of original size [2023-02-14 01:59:26,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2023-02-14 01:59:26,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:59:26,667 INFO L350 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 21 treesize of output 20 [2023-02-14 01:59:26,698 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 01:59:26,698 INFO L350 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 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-14 01:59:26,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:59:26,880 INFO L350 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 27 treesize of output 19 [2023-02-14 01:59:26,957 INFO L350 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 15 [2023-02-14 01:59:27,242 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 01:59:27,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2023-02-14 01:59:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:27,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:27,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:27,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660945794] [2023-02-14 01:59:27,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660945794] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:27,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:27,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-02-14 01:59:27,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439411672] [2023-02-14 01:59:27,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:27,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-14 01:59:27,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:27,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-14 01:59:27,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2023-02-14 01:59:27,306 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:59:40,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:42,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:44,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:46,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:49,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:51,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:53,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:55,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:57,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:59,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:01,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:03,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:05,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:07,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:09,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:11,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:13,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:15,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:17,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:19,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:21,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:23,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:25,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:27,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:29,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:31,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:33,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:33,836 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2023-02-14 02:00:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-14 02:00:33,836 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2023-02-14 02:00:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:33,837 INFO L225 Difference]: With dead ends: 78 [2023-02-14 02:00:33,837 INFO L226 Difference]: Without dead ends: 78 [2023-02-14 02:00:33,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=267, Invalid=2085, Unknown=0, NotChecked=0, Total=2352 [2023-02-14 02:00:33,838 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 150 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 33 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.4s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:33,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 326 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 812 Invalid, 27 Unknown, 0 Unchecked, 55.4s Time] [2023-02-14 02:00:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-14 02:00:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-02-14 02:00:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 64 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 02:00:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2023-02-14 02:00:33,841 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 35 [2023-02-14 02:00:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:33,841 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2023-02-14 02:00:33,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:00:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2023-02-14 02:00:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-14 02:00:33,841 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:33,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00:33,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:34,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:34,050 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_list_delErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 02:00:34,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:34,051 INFO L85 PathProgramCache]: Analyzing trace with hash 609411340, now seen corresponding path program 1 times [2023-02-14 02:00:34,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:34,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911076775] [2023-02-14 02:00:34,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:34,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:34,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:34,052 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:34,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-14 02:00:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:34,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 82 conjunts are in the unsatisfiable core [2023-02-14 02:00:34,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:34,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:00:34,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:34,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-14 02:00:34,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 02:00:34,319 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:34,320 INFO L350 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 [2023-02-14 02:00:34,335 INFO L350 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 12 treesize of output 14 [2023-02-14 02:00:34,430 INFO L350 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 7 treesize of output 3 [2023-02-14 02:00:34,434 INFO L350 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 7 treesize of output 3 [2023-02-14 02:00:34,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:00:34,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:00:34,704 INFO L350 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 21 treesize of output 20 [2023-02-14 02:00:34,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2023-02-14 02:00:34,749 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 02:00:34,749 INFO L350 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 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-14 02:00:34,776 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 02:00:34,777 INFO L350 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 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-14 02:00:35,023 INFO L350 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 27 treesize of output 19 [2023-02-14 02:00:35,028 INFO L350 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 27 treesize of output 19 [2023-02-14 02:00:35,613 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-14 02:00:35,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2023-02-14 02:00:35,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2023-02-14 02:00:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:00:35,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:00:35,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:35,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911076775] [2023-02-14 02:00:35,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911076775] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:00:35,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:00:35,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-02-14 02:00:35,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695541485] [2023-02-14 02:00:35,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:35,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-14 02:00:35,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:35,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-14 02:00:35,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2023-02-14 02:00:35,718 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 23 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:00:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:38,655 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2023-02-14 02:00:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 02:00:38,656 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2023-02-14 02:00:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:38,656 INFO L225 Difference]: With dead ends: 77 [2023-02-14 02:00:38,656 INFO L226 Difference]: Without dead ends: 77 [2023-02-14 02:00:38,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=162, Invalid=1244, Unknown=0, NotChecked=0, Total=1406 [2023-02-14 02:00:38,657 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 75 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:38,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 410 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 776 Invalid, 3 Unknown, 0 Unchecked, 1.9s Time] [2023-02-14 02:00:38,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-14 02:00:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-02-14 02:00:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 64 states have internal predecessors, (68), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 02:00:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2023-02-14 02:00:38,659 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 35 [2023-02-14 02:00:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:38,659 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2023-02-14 02:00:38,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:00:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2023-02-14 02:00:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 02:00:38,660 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:38,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00:38,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:38,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:38,861 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_list_delErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 02:00:38,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:38,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1711882371, now seen corresponding path program 1 times [2023-02-14 02:00:38,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:38,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23167590] [2023-02-14 02:00:38,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:38,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:38,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:38,862 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:38,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-14 02:00:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:39,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-14 02:00:39,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:39,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:39,050 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:39,050 INFO L350 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 [2023-02-14 02:00:39,189 INFO L350 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 [2023-02-14 02:00:39,251 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-02-14 02:00:39,251 INFO L350 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 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 02:00:39,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:00:39,461 INFO L350 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 25 treesize of output 17 [2023-02-14 02:00:39,786 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-14 02:00:39,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 14 [2023-02-14 02:00:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:00:39,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:00:39,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:39,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23167590] [2023-02-14 02:00:39,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23167590] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:00:39,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:00:39,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-02-14 02:00:39,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327079419] [2023-02-14 02:00:39,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:39,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-14 02:00:39,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-14 02:00:39,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2023-02-14 02:00:39,853 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 22 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:00:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:42,031 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2023-02-14 02:00:42,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-14 02:00:42,032 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2023-02-14 02:00:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:42,032 INFO L225 Difference]: With dead ends: 77 [2023-02-14 02:00:42,032 INFO L226 Difference]: Without dead ends: 77 [2023-02-14 02:00:42,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2023-02-14 02:00:42,033 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 129 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:42,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 208 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-14 02:00:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-14 02:00:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-02-14 02:00:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 64 states have internal predecessors, (67), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 02:00:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2023-02-14 02:00:42,035 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 36 [2023-02-14 02:00:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:42,036 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2023-02-14 02:00:42,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:00:42,036 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2023-02-14 02:00:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 02:00:42,036 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:42,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00:42,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:42,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:42,244 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_list_delErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 02:00:42,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:42,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1711882372, now seen corresponding path program 1 times [2023-02-14 02:00:42,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:42,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687444572] [2023-02-14 02:00:42,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:42,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:42,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:42,246 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:42,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-02-14 02:00:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:42,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-14 02:00:42,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:42,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:00:42,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:42,470 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:00:42,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-14 02:00:42,480 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:42,480 INFO L350 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 [2023-02-14 02:00:42,639 INFO L350 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 [2023-02-14 02:00:42,645 INFO L350 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 [2023-02-14 02:00:42,708 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-02-14 02:00:42,708 INFO L350 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 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 02:00:42,732 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-02-14 02:00:42,732 INFO L350 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 1 case distinctions, treesize of input 21 treesize of output 30 [2023-02-14 02:00:43,458 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-14 02:00:43,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2023-02-14 02:00:43,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2023-02-14 02:00:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:00:43,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:00:43,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:43,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687444572] [2023-02-14 02:00:43,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687444572] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:00:43,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:00:43,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-14 02:00:43,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61787639] [2023-02-14 02:00:43,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:43,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-14 02:00:43,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:43,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-14 02:00:43,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2023-02-14 02:00:43,574 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:00:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:52,447 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2023-02-14 02:00:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-14 02:00:52,447 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2023-02-14 02:00:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:52,448 INFO L225 Difference]: With dead ends: 75 [2023-02-14 02:00:52,448 INFO L226 Difference]: Without dead ends: 75 [2023-02-14 02:00:52,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=175, Invalid=1154, Unknown=3, NotChecked=0, Total=1332 [2023-02-14 02:00:52,449 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 101 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 11 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:52,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 236 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 780 Invalid, 4 Unknown, 0 Unchecked, 1.8s Time] [2023-02-14 02:00:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-14 02:00:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-02-14 02:00:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 64 states have internal predecessors, (66), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 02:00:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2023-02-14 02:00:52,451 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 36 [2023-02-14 02:00:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:52,451 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2023-02-14 02:00:52,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:00:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2023-02-14 02:00:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 02:00:52,452 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:52,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00:52,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:52,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:52,657 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 02:00:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:52,657 INFO L85 PathProgramCache]: Analyzing trace with hash 270693189, now seen corresponding path program 1 times [2023-02-14 02:00:52,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:52,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600099422] [2023-02-14 02:00:52,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:52,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:52,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:52,659 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:52,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-14 02:00:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:52,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-14 02:00:52,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:53,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:00:53,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-14 02:00:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:00:53,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:00:53,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:53,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600099422] [2023-02-14 02:00:53,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600099422] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:00:53,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:00:53,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-14 02:00:53,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168408487] [2023-02-14 02:00:53,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:53,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-14 02:00:53,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 02:00:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-02-14 02:00:53,385 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 16 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 02:00:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:54,087 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2023-02-14 02:00:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 02:00:54,088 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2023-02-14 02:00:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:54,090 INFO L225 Difference]: With dead ends: 76 [2023-02-14 02:00:54,090 INFO L226 Difference]: Without dead ends: 76 [2023-02-14 02:00:54,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2023-02-14 02:00:54,091 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 99 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:54,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 342 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 02:00:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-14 02:00:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2023-02-14 02:00:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 64 states have internal predecessors, (65), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 02:00:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2023-02-14 02:00:54,098 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 41 [2023-02-14 02:00:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:54,098 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2023-02-14 02:00:54,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 02:00:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2023-02-14 02:00:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 02:00:54,098 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:54,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00:54,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:54,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:54,299 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 02:00:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:54,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1727710868, now seen corresponding path program 1 times [2023-02-14 02:00:54,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:54,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496506711] [2023-02-14 02:00:54,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:54,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:54,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:54,301 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:54,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-14 02:00:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:54,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-14 02:00:54,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:54,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:54,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-14 02:00:58,564 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 02:00:58,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 02:00:58,657 INFO L350 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 7 treesize of output 3 [2023-02-14 02:00:58,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:00:58,883 INFO L350 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 21 treesize of output 20 [2023-02-14 02:00:58,914 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 02:00:58,915 INFO L350 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 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-14 02:00:58,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:00:59,082 INFO L350 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 27 treesize of output 19 [2023-02-14 02:00:59,169 INFO L350 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 15 [2023-02-14 02:00:59,441 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-14 02:00:59,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 11 [2023-02-14 02:00:59,596 INFO L321 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2023-02-14 02:00:59,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 20 [2023-02-14 02:00:59,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:00:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:00:59,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:00:59,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:59,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496506711] [2023-02-14 02:00:59,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496506711] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:00:59,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:00:59,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2023-02-14 02:00:59,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657750249] [2023-02-14 02:00:59,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:59,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-14 02:00:59,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:59,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-14 02:00:59,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2023-02-14 02:00:59,703 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 25 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 02:01:16,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:18,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:20,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:22,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:24,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:27,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:29,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:31,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:33,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:35,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:37,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:39,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:41,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:43,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:45,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:47,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:49,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:01:49,914 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2023-02-14 02:01:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-14 02:01:49,915 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2023-02-14 02:01:49,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:01:49,915 INFO L225 Difference]: With dead ends: 78 [2023-02-14 02:01:49,915 INFO L226 Difference]: Without dead ends: 78 [2023-02-14 02:01:49,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=169, Invalid=1313, Unknown=0, NotChecked=0, Total=1482 [2023-02-14 02:01:49,916 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 57 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 11 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.5s IncrementalHoareTripleChecker+Time [2023-02-14 02:01:49,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 238 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 863 Invalid, 20 Unknown, 0 Unchecked, 35.5s Time] [2023-02-14 02:01:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-14 02:01:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2023-02-14 02:01:49,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 66 states have internal predecessors, (68), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 02:01:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2023-02-14 02:01:49,918 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 44 [2023-02-14 02:01:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:01:49,918 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2023-02-14 02:01:49,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 02:01:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2023-02-14 02:01:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 02:01:49,919 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:01:49,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:01:49,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-02-14 02:01:50,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:01:50,125 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 02:01:50,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:01:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1727710867, now seen corresponding path program 1 times [2023-02-14 02:01:50,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:01:50,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808458201] [2023-02-14 02:01:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:01:50,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:01:50,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:01:50,127 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:01:50,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-14 02:01:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:01:50,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 74 conjunts are in the unsatisfiable core [2023-02-14 02:01:50,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:01:50,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:01:50,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:01:50,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 02:01:50,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-14 02:01:50,402 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:01:50,402 INFO L350 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 [2023-02-14 02:01:50,408 INFO L350 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 12 treesize of output 14 [2023-02-14 02:01:50,509 INFO L350 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 7 treesize of output 3 [2023-02-14 02:01:50,513 INFO L350 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 7 treesize of output 3 [2023-02-14 02:01:50,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:01:50,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:01:50,779 INFO L350 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 21 treesize of output 20 [2023-02-14 02:01:50,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2023-02-14 02:01:50,828 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 02:01:50,828 INFO L350 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 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-14 02:01:50,852 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-02-14 02:01:50,852 INFO L350 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 1 case distinctions, treesize of input 23 treesize of output 34 [2023-02-14 02:01:51,086 INFO L350 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 27 treesize of output 19 [2023-02-14 02:01:51,091 INFO L350 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 27 treesize of output 19 [2023-02-14 02:01:51,364 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-14 02:01:51,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2023-02-14 02:01:51,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2023-02-14 02:01:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:01:51,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:01:51,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:01:51,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808458201] [2023-02-14 02:01:51,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808458201] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:01:51,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:01:51,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-14 02:01:51,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775217118] [2023-02-14 02:01:51,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:01:51,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-14 02:01:51,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:01:51,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-14 02:01:51,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2023-02-14 02:01:51,582 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 21 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 02:01:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:01:53,945 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2023-02-14 02:01:53,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 02:01:53,946 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2023-02-14 02:01:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:01:53,946 INFO L225 Difference]: With dead ends: 78 [2023-02-14 02:01:53,946 INFO L226 Difference]: Without dead ends: 78 [2023-02-14 02:01:53,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2023-02-14 02:01:53,947 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 10 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-14 02:01:53,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 373 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 707 Invalid, 5 Unknown, 0 Unchecked, 1.6s Time] [2023-02-14 02:01:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-14 02:01:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2023-02-14 02:01:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 66 states have internal predecessors, (67), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 02:01:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2023-02-14 02:01:53,949 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 44 [2023-02-14 02:01:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:01:53,950 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2023-02-14 02:01:53,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 02:01:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2023-02-14 02:01:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 02:01:53,950 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:01:53,951 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:01:53,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-02-14 02:01:54,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:01:54,159 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 02:01:54,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:01:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1073352938, now seen corresponding path program 1 times [2023-02-14 02:01:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:01:54,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89754607] [2023-02-14 02:01:54,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:01:54,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:01:54,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:01:54,161 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:01:54,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-14 02:01:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:01:54,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 02:01:54,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:01:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:01:54,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:01:54,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:01:54,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89754607] [2023-02-14 02:01:54,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89754607] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:01:54,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:01:54,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:01:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396994716] [2023-02-14 02:01:54,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:01:54,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:01:54,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:01:54,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:01:54,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:01:54,326 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-14 02:01:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:01:54,453 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2023-02-14 02:01:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:01:54,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2023-02-14 02:01:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:01:54,454 INFO L225 Difference]: With dead ends: 75 [2023-02-14 02:01:54,454 INFO L226 Difference]: Without dead ends: 75 [2023-02-14 02:01:54,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-14 02:01:54,455 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 36 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:01:54,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 140 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:01:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-14 02:01:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-02-14 02:01:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 64 states have internal predecessors, (65), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 02:01:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2023-02-14 02:01:54,457 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 49 [2023-02-14 02:01:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:01:54,457 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2023-02-14 02:01:54,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-14 02:01:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2023-02-14 02:01:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 02:01:54,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:01:54,458 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:01:54,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 (32)] Forceful destruction successful, exit code 0 [2023-02-14 02:01:54,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:01:54,668 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 02:01:54,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:01:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1073352939, now seen corresponding path program 1 times [2023-02-14 02:01:54,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:01:54,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162979895] [2023-02-14 02:01:54,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:01:54,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:01:54,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:01:54,670 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:01:54,670 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 (33)] Waiting until timeout for monitored process [2023-02-14 02:01:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:01:54,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-14 02:01:54,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:01:54,992 INFO L350 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 29 treesize of output 17 [2023-02-14 02:01:54,993 INFO L350 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 44 treesize of output 20 [2023-02-14 02:01:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:01:55,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:01:56,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:01:56,197 INFO L350 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 44 treesize of output 46 [2023-02-14 02:02:01,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:02:01,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 151 [2023-02-14 02:02:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:02:04,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:02:04,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162979895] [2023-02-14 02:02:04,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162979895] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:02:04,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:02:04,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-02-14 02:02:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937430004] [2023-02-14 02:02:04,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:02:04,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 02:02:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:02:04,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 02:02:04,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2023-02-14 02:02:04,427 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 22 states have internal predecessors, (60), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-14 02:02:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:02:09,796 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2023-02-14 02:02:09,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 02:02:09,798 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 22 states have internal predecessors, (60), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2023-02-14 02:02:09,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:02:09,799 INFO L225 Difference]: With dead ends: 85 [2023-02-14 02:02:09,799 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 02:02:09,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260 [2023-02-14 02:02:09,800 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 140 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-14 02:02:09,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 308 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-02-14 02:02:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 02:02:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2023-02-14 02:02:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 69 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 02:02:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2023-02-14 02:02:09,806 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 49 [2023-02-14 02:02:09,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:02:09,806 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2023-02-14 02:02:09,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 22 states have internal predecessors, (60), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-14 02:02:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2023-02-14 02:02:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 02:02:09,806 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:02:09,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:02:09,815 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 (33)] Forceful destruction successful, exit code 0 [2023-02-14 02:02:10,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:02:10,011 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 02:02:10,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:02:10,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1073250912, now seen corresponding path program 1 times [2023-02-14 02:02:10,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:02:10,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751650495] [2023-02-14 02:02:10,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:02:10,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 [2023-02-14 02:02:10,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:02:10,013 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:02:10,015 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 (34)] Waiting until timeout for monitored process [2023-02-14 02:02:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:02:10,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-14 02:02:10,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:02:10,316 INFO L321 Elim1Store]: treesize reduction 17, result has 50.0 percent of original size [2023-02-14 02:02:10,317 INFO L350 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 3 case distinctions, treesize of input 33 treesize of output 43 [2023-02-14 02:02:10,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:02:10,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-14 02:02:10,648 INFO L321 Elim1Store]: treesize reduction 17, result has 50.0 percent of original size [2023-02-14 02:02:10,648 INFO L350 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 3 case distinctions, treesize of input 33 treesize of output 43 [2023-02-14 02:02:17,251 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_free_14_~p~1#1.base| (_ BitVec 32)) (v_ArrVal_771 (_ BitVec 1)) (|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_7| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_7| v_ArrVal_771))) (and (= (_ bv0 1) (select .cse0 |ULTIMATE.start_free_14_~p~1#1.base|)) (= |c_#valid| (store (store .cse0 |ULTIMATE.start_free_14_~p~1#1.base| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_7| (_ bv0 1))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_7|) (_ bv0 1))))) is different from true [2023-02-14 02:02:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:02:17,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:02:21,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2023-02-14 02:02:22,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:02:22,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751650495] [2023-02-14 02:02:22,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751650495] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:02:22,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [133123979] [2023-02-14 02:02:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:02:22,185 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 02:02:22,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 02:02:22,187 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 02:02:22,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-02-14 02:02:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:02:22,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-14 02:02:22,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:02:22,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:02:22,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:02:23,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:02:23,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:02:23,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:02:23,309 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2023-02-14 02:02:23,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2023-02-14 02:02:23,318 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:02:23,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 02:02:23,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:02:23,570 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:02:23,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 02:02:23,869 INFO L350 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 40 treesize of output 24 [2023-02-14 02:02:24,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:02:24,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:02:24,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:02:24,235 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2023-02-14 02:02:24,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2023-02-14 02:02:24,554 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_free_14_~p~1#1.base| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_8| (_ BitVec 32)) (v_ArrVal_821 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_8| v_ArrVal_821))) (and (bvult |#StackHeapBarrier| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_8|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_8|)) (bvult |ULTIMATE.start_free_14_~p~1#1.base| |#StackHeapBarrier|) (= |c_#valid| (store (store .cse0 |ULTIMATE.start_free_14_~p~1#1.base| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_8| (_ bv0 1))) (= (_ bv0 1) (select .cse0 |ULTIMATE.start_free_14_~p~1#1.base|)))))) is different from true [2023-02-14 02:02:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:02:24,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:02:24,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2023-02-14 02:02:25,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [133123979] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:02:25,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:02:25,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 31 [2023-02-14 02:02:25,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753727510] [2023-02-14 02:02:25,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:02:25,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-14 02:02:25,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:02:25,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-14 02:02:25,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1225, Unknown=5, NotChecked=142, Total=1482 [2023-02-14 02:02:25,049 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 32 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-14 02:02:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:02:40,213 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2023-02-14 02:02:40,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 02:02:40,213 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2023-02-14 02:02:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:02:40,216 INFO L225 Difference]: With dead ends: 89 [2023-02-14 02:02:40,216 INFO L226 Difference]: Without dead ends: 86 [2023-02-14 02:02:40,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=292, Invalid=3013, Unknown=9, NotChecked=226, Total=3540 [2023-02-14 02:02:40,217 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 145 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 38 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-14 02:02:40,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 241 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1022 Invalid, 3 Unknown, 134 Unchecked, 2.4s Time] [2023-02-14 02:02:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-14 02:02:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2023-02-14 02:02:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 69 states have internal predecessors, (70), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 02:02:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2023-02-14 02:02:40,219 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 49 [2023-02-14 02:02:40,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:02:40,219 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2023-02-14 02:02:40,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-14 02:02:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2023-02-14 02:02:40,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 02:02:40,220 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:02:40,220 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:02:40,236 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 (34)] Ended with exit code 0 [2023-02-14 02:02:40,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2023-02-14 02:02:40,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 02:02:40,636 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-14 02:02:40,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:02:40,637 INFO L85 PathProgramCache]: Analyzing trace with hash 225896062, now seen corresponding path program 1 times [2023-02-14 02:02:40,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:02:40,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292076059] [2023-02-14 02:02:40,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:02:40,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:02:40,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:02:40,639 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:02:40,641 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 (36)] Waiting until timeout for monitored process [2023-02-14 02:02:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:02:40,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-14 02:02:40,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:02:40,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:02:40,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:02:40,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 02:02:40,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-14 02:02:41,047 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:02:41,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-14 02:02:41,066 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:02:41,066 INFO L350 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 [2023-02-14 02:02:41,188 INFO L350 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 7 treesize of output 3 [2023-02-14 02:02:41,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:02:41,522 INFO L350 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 21 treesize of output 20 [2023-02-14 02:02:41,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:02:41,559 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-02-14 02:02:41,559 INFO L350 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 1 case distinctions, treesize of input 23 treesize of output 34 [2023-02-14 02:02:41,786 INFO L350 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 27 treesize of output 19 [2023-02-14 02:02:41,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-14 02:02:42,256 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-14 02:02:42,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 11 [2023-02-14 02:02:42,311 INFO L321 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2023-02-14 02:02:42,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 20 [2023-02-14 02:02:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:02:42,977 INFO L328 TraceCheckSpWp]: Computing backward predicates...