./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0102-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae 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/memsafety/test-0102-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:10:04,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:10:04,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:10:04,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:10:04,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:10:04,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:10:04,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:10:04,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:10:04,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:10:04,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:10:04,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:10:04,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:10:04,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:10:04,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:10:04,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:10:04,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:10:04,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:10:04,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:10:04,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:10:04,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:10:04,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:10:04,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:10:04,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:10:04,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:10:04,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:10:04,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:10:04,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:10:04,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:10:04,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:10:04,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:10:04,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:10:04,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:10:04,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:10:04,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:10:04,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:10:04,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:10:04,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:10:04,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:10:04,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:10:04,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:10:04,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:10:04,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:10:04,332 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:10:04,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:10:04,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:10:04,333 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:10:04,333 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:10:04,334 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:10:04,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:10:04,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:10:04,334 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:10:04,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:10:04,335 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:10:04,335 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:10:04,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:10:04,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:10:04,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:10:04,336 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:10:04,336 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:10:04,336 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:10:04,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:10:04,337 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:10:04,337 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:10:04,337 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:10:04,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:10:04,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:10:04,337 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:10:04,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:10:04,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:10:04,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:10:04,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:10:04,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:10:04,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:10:04,339 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:10:04,339 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:10:04,339 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:10:04,339 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 -> d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 [2023-02-16 03:10:04,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:10:04,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:10:04,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:10:04,578 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:10:04,578 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:10:04,579 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0102-2.i [2023-02-16 03:10:05,557 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:10:05,739 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:10:05,740 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-2.i [2023-02-16 03:10:05,748 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2acff325b/fb94a1d614774e4985b0d6e6f7a43680/FLAGa136da4a8 [2023-02-16 03:10:05,760 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2acff325b/fb94a1d614774e4985b0d6e6f7a43680 [2023-02-16 03:10:05,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:10:05,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:10:05,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:10:05,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:10:05,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:10:05,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:10:05" (1/1) ... [2023-02-16 03:10:05,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e05dd2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:05, skipping insertion in model container [2023-02-16 03:10:05,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:10:05" (1/1) ... [2023-02-16 03:10:05,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:10:05,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:10:06,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:10:06,051 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-16 03:10:06,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a2aa319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:06, skipping insertion in model container [2023-02-16 03:10:06,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:10:06,052 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-16 03:10:06,054 INFO L158 Benchmark]: Toolchain (without parser) took 289.99ms. Allocated memory is still 111.1MB. Free memory was 67.2MB in the beginning and 55.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 03:10:06,054 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory was 82.1MB in the beginning and 82.0MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:10:06,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.38ms. Allocated memory is still 111.1MB. Free memory was 66.8MB in the beginning and 55.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 03:10:06,056 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.15ms. Allocated memory is still 111.1MB. Free memory was 82.1MB in the beginning and 82.0MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.38ms. Allocated memory is still 111.1MB. Free memory was 66.8MB in the beginning and 55.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 551]: 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/memsafety/test-0102-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:10:07,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:10:07,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:10:07,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:10:07,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:10:07,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:10:07,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:10:07,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:10:07,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:10:07,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:10:07,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:10:07,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:10:07,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:10:07,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:10:07,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:10:07,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:10:07,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:10:07,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:10:07,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:10:07,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:10:07,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:10:07,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:10:07,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:10:07,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:10:07,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:10:07,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:10:07,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:10:07,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:10:07,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:10:07,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:10:07,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:10:07,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:10:07,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:10:07,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:10:07,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:10:07,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:10:07,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:10:07,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:10:07,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:10:07,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:10:07,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:10:07,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-16 03:10:07,869 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:10:07,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:10:07,870 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:10:07,870 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:10:07,871 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:10:07,871 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:10:07,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:10:07,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:10:07,872 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:10:07,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:10:07,873 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:10:07,873 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:10:07,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:10:07,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:10:07,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:10:07,874 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:10:07,874 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:10:07,874 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:10:07,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:10:07,874 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:10:07,874 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:10:07,875 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:10:07,875 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:10:07,875 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:10:07,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:10:07,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:10:07,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:10:07,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:10:07,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:10:07,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:10:07,876 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:10:07,876 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:10:07,876 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:10:07,877 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:10:07,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:10:07,877 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:10:07,877 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:10:07,877 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 -> d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 [2023-02-16 03:10:08,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:10:08,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:10:08,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:10:08,159 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:10:08,159 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:10:08,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0102-2.i [2023-02-16 03:10:09,238 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:10:09,465 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:10:09,470 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-2.i [2023-02-16 03:10:09,481 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f1bc205/c1d3dc752aea41dda972fcaa06392713/FLAG3c4f8396a [2023-02-16 03:10:09,497 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f1bc205/c1d3dc752aea41dda972fcaa06392713 [2023-02-16 03:10:09,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:10:09,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:10:09,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:10:09,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:10:09,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:10:09,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:09,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b33d75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09, skipping insertion in model container [2023-02-16 03:10:09,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:09,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:10:09,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:10:09,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:10:09,806 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-16 03:10:09,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:10:09,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:10:09,851 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:10:09,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:10:09,909 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:10:09,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09 WrapperNode [2023-02-16 03:10:09,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:10:09,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:10:09,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:10:09,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:10:09,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:09,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:09,965 INFO L138 Inliner]: procedures = 136, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2023-02-16 03:10:09,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:10:09,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:10:09,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:10:09,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:10:09,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:09,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:09,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:09,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:09,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:09,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:10,000 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:10,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:10,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:10:10,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:10:10,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:10:10,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:10:10,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:10,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:10:10,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:10:10,030 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-16 03:10:10,032 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-16 03:10:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2023-02-16 03:10:10,054 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2023-02-16 03:10:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:10:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:10:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure create_sub_list [2023-02-16 03:10:10,054 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sub_list [2023-02-16 03:10:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 03:10:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:10:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:10:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-16 03:10:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:10:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 03:10:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 03:10:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:10:10,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:10:10,162 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:10:10,163 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:10:10,492 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:10:10,500 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:10:10,500 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-16 03:10:10,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:10:10 BoogieIcfgContainer [2023-02-16 03:10:10,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:10:10,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:10:10,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:10:10,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:10:10,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:10:09" (1/3) ... [2023-02-16 03:10:10,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3403f648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:10:10, skipping insertion in model container [2023-02-16 03:10:10,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09" (2/3) ... [2023-02-16 03:10:10,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3403f648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:10:10, skipping insertion in model container [2023-02-16 03:10:10,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:10:10" (3/3) ... [2023-02-16 03:10:10,509 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0102-2.i [2023-02-16 03:10:10,522 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:10:10,522 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-02-16 03:10:10,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:10:10,569 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;@381de96e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:10:10,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-02-16 03:10:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 76 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:10:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:10:10,579 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:10,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:10:10,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:10,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:10,586 INFO L85 PathProgramCache]: Analyzing trace with hash 60205689, now seen corresponding path program 1 times [2023-02-16 03:10:10,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:10,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379092181] [2023-02-16 03:10:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:10,596 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-16 03:10:10,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:10,599 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-16 03:10:10,601 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-16 03:10:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:10,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 03:10:10,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:10,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-16 03:10:10,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:10,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:10,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379092181] [2023-02-16 03:10:10,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379092181] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:10,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:10,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:10:10,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525162219] [2023-02-16 03:10:10,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:10,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 03:10:10,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:10,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 03:10:10,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:10:10,702 INFO L87 Difference]: Start difference. First operand has 83 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 76 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:10,718 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-02-16 03:10:10,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 03:10:10,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-16 03:10:10,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:10,727 INFO L225 Difference]: With dead ends: 83 [2023-02-16 03:10:10,727 INFO L226 Difference]: Without dead ends: 81 [2023-02-16 03:10:10,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:10:10,733 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:10,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:10:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-16 03:10:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-16 03:10:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 74 states have internal predecessors, (78), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:10:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-16 03:10:10,764 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 5 [2023-02-16 03:10:10,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:10,764 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-16 03:10:10,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:10,764 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-16 03:10:10,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 03:10:10,765 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:10,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:10,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-16 03:10:10,972 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-16 03:10:10,972 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:10,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2005144647, now seen corresponding path program 1 times [2023-02-16 03:10:10,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:10,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050745493] [2023-02-16 03:10:10,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:10,974 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-16 03:10:10,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:10,975 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-16 03:10:10,976 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-16 03:10:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:11,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:10:11,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:11,056 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-16 03:10:11,099 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-16 03:10:11,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:11,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:11,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050745493] [2023-02-16 03:10:11,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050745493] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:11,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:11,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:10:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334244633] [2023-02-16 03:10:11,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:11,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:10:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:11,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:10:11,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:10:11,110 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:11,341 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-02-16 03:10:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:10:11,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-16 03:10:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:11,343 INFO L225 Difference]: With dead ends: 108 [2023-02-16 03:10:11,344 INFO L226 Difference]: Without dead ends: 108 [2023-02-16 03:10:11,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-16 03:10:11,344 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 60 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:11,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 162 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:10:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-16 03:10:11,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 79. [2023-02-16 03:10:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 72 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:10:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-02-16 03:10:11,354 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 7 [2023-02-16 03:10:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:11,354 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-02-16 03:10:11,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-02-16 03:10:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 03:10:11,355 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:11,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:11,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-02-16 03:10:11,562 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-16 03:10:11,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:11,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:11,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2005144648, now seen corresponding path program 1 times [2023-02-16 03:10:11,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:11,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854868072] [2023-02-16 03:10:11,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:11,564 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-16 03:10:11,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:11,565 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-16 03:10:11,567 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-16 03:10:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:11,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:10:11,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:11,620 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-16 03:10:11,652 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-16 03:10:11,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:11,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:11,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854868072] [2023-02-16 03:10:11,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854868072] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:11,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:11,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:10:11,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548492901] [2023-02-16 03:10:11,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:11,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:10:11,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:11,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:10:11,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:10:11,655 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:11,829 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-02-16 03:10:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:10:11,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-16 03:10:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:11,831 INFO L225 Difference]: With dead ends: 83 [2023-02-16 03:10:11,831 INFO L226 Difference]: Without dead ends: 83 [2023-02-16 03:10:11,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-16 03:10:11,832 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:11,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 234 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:10:11,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-16 03:10:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2023-02-16 03:10:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 74 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:10:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-02-16 03:10:11,837 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 7 [2023-02-16 03:10:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:11,838 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-02-16 03:10:11,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-02-16 03:10:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:10:11,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:11,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:11,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:10:12,038 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-16 03:10:12,039 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting create_sub_listErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:12,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:12,039 INFO L85 PathProgramCache]: Analyzing trace with hash 859208239, now seen corresponding path program 1 times [2023-02-16 03:10:12,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:12,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056630490] [2023-02-16 03:10:12,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:12,040 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-16 03:10:12,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:12,041 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-16 03:10:12,042 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-16 03:10:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:12,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 03:10:12,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:12,097 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-16 03:10:12,102 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-16 03:10:12,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:12,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:12,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056630490] [2023-02-16 03:10:12,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056630490] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:12,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:12,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:10:12,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069989526] [2023-02-16 03:10:12,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:12,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:10:12,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:12,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:10:12,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:10:12,105 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:12,184 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2023-02-16 03:10:12,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:10:12,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-16 03:10:12,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:12,185 INFO L225 Difference]: With dead ends: 82 [2023-02-16 03:10:12,185 INFO L226 Difference]: Without dead ends: 82 [2023-02-16 03:10:12,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:10:12,186 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:12,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 122 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-16 03:10:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2023-02-16 03:10:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 73 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:10:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-16 03:10:12,191 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 11 [2023-02-16 03:10:12,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:12,192 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-16 03:10:12,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-16 03:10:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:10:12,192 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:12,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:12,202 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-16 03:10:12,397 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-16 03:10:12,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting create_sub_listErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:12,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash 859208240, now seen corresponding path program 1 times [2023-02-16 03:10:12,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:12,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970572242] [2023-02-16 03:10:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:12,398 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-16 03:10:12,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:12,406 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-16 03:10:12,408 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-16 03:10:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:12,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:10:12,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:12,465 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-16 03:10:12,476 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-16 03:10:12,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:12,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:12,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970572242] [2023-02-16 03:10:12,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970572242] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:12,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:12,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:10:12,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50562853] [2023-02-16 03:10:12,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:12,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:10:12,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:12,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:10:12,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:10:12,478 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:12,578 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-02-16 03:10:12,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:10:12,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-16 03:10:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:12,579 INFO L225 Difference]: With dead ends: 81 [2023-02-16 03:10:12,579 INFO L226 Difference]: Without dead ends: 81 [2023-02-16 03:10:12,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:10:12,580 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:12,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 126 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-16 03:10:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2023-02-16 03:10:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 72 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:10:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2023-02-16 03:10:12,584 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 11 [2023-02-16 03:10:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:12,584 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2023-02-16 03:10:12,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,585 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2023-02-16 03:10:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 03:10:12,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:12,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:12,592 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-16 03:10:12,785 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-16 03:10:12,786 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:12,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:12,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1332328513, now seen corresponding path program 1 times [2023-02-16 03:10:12,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:12,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707472174] [2023-02-16 03:10:12,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:12,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:10:12,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:12,787 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:10:12,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-16 03:10:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:12,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:10:12,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:12,877 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-16 03:10:12,912 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:10:12,913 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-16 03:10:12,946 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-16 03:10:12,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:12,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:12,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707472174] [2023-02-16 03:10:12,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707472174] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:12,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:12,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:10:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969759200] [2023-02-16 03:10:12,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:12,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:10:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:12,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:10:12,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:10:12,948 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:13,245 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2023-02-16 03:10:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:10:13,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-16 03:10:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:13,247 INFO L225 Difference]: With dead ends: 129 [2023-02-16 03:10:13,247 INFO L226 Difference]: Without dead ends: 129 [2023-02-16 03:10:13,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:10:13,247 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 108 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:13,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 235 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:10:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-16 03:10:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 90. [2023-02-16 03:10:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 81 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:10:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2023-02-16 03:10:13,253 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 14 [2023-02-16 03:10:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:13,253 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2023-02-16 03:10:13,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2023-02-16 03:10:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 03:10:13,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:13,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:13,269 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-16 03:10:13,465 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-16 03:10:13,465 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:13,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:13,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1332328512, now seen corresponding path program 1 times [2023-02-16 03:10:13,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:13,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789823618] [2023-02-16 03:10:13,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:13,466 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-16 03:10:13,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:13,467 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-16 03:10:13,468 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-16 03:10:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:13,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:10:13,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:13,581 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-16 03:10:13,584 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-16 03:10:13,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:13,680 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-16 03:10:13,689 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:13,689 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-16 03:10:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:13,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:13,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:13,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789823618] [2023-02-16 03:10:13,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789823618] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:13,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:13,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:10:13,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326345197] [2023-02-16 03:10:13,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:13,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:10:13,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:13,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:10:13,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:10:13,747 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:14,154 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2023-02-16 03:10:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:10:14,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-16 03:10:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:14,155 INFO L225 Difference]: With dead ends: 117 [2023-02-16 03:10:14,155 INFO L226 Difference]: Without dead ends: 117 [2023-02-16 03:10:14,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:10:14,156 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 52 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:14,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 298 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:10:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-16 03:10:14,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2023-02-16 03:10:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.676056338028169) internal successors, (119), 97 states have internal predecessors, (119), 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-16 03:10:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2023-02-16 03:10:14,165 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 14 [2023-02-16 03:10:14,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:14,165 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2023-02-16 03:10:14,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2023-02-16 03:10:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:10:14,166 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:14,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:14,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-02-16 03:10:14,374 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-16 03:10:14,374 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting list_add_tailErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:14,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash -467443808, now seen corresponding path program 1 times [2023-02-16 03:10:14,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:14,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142001881] [2023-02-16 03:10:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:14,375 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-16 03:10:14,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:14,376 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-16 03:10:14,377 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-16 03:10:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:14,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:10:14,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:14,471 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-16 03:10:14,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:14,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:14,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142001881] [2023-02-16 03:10:14,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142001881] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:14,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:14,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:10:14,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259303021] [2023-02-16 03:10:14,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:14,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:10:14,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:14,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:10:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:10:14,473 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:14,563 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2023-02-16 03:10:14,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:10:14,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 03:10:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:14,565 INFO L225 Difference]: With dead ends: 107 [2023-02-16 03:10:14,565 INFO L226 Difference]: Without dead ends: 107 [2023-02-16 03:10:14,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:10:14,565 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 27 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:14,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 154 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-16 03:10:14,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-16 03:10:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 96 states have internal predecessors, (116), 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-16 03:10:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2023-02-16 03:10:14,570 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 16 [2023-02-16 03:10:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:14,570 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2023-02-16 03:10:14,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2023-02-16 03:10:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:10:14,571 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:14,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:14,587 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-16 03:10:14,777 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-16 03:10:14,778 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting list_add_tailErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:14,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash -467443807, now seen corresponding path program 1 times [2023-02-16 03:10:14,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:14,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646290735] [2023-02-16 03:10:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:14,779 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-16 03:10:14,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:14,780 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-16 03:10:14,781 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-16 03:10:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:14,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:10:14,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:14,948 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-16 03:10:14,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:14,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:14,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646290735] [2023-02-16 03:10:14,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646290735] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:14,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:14,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 03:10:14,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106282164] [2023-02-16 03:10:14,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:14,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:10:14,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:14,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:10:14,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:10:14,949 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:15,220 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2023-02-16 03:10:15,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:10:15,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 03:10:15,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:15,222 INFO L225 Difference]: With dead ends: 115 [2023-02-16 03:10:15,222 INFO L226 Difference]: Without dead ends: 115 [2023-02-16 03:10:15,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:10:15,222 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 113 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:15,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 456 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:10:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-16 03:10:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2023-02-16 03:10:15,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.619718309859155) internal successors, (115), 96 states have internal predecessors, (115), 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-16 03:10:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2023-02-16 03:10:15,226 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 16 [2023-02-16 03:10:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:15,226 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2023-02-16 03:10:15,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2023-02-16 03:10:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:10:15,227 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:15,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:15,243 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-16 03:10:15,427 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-16 03:10:15,427 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting list_add_tailErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1605856063, now seen corresponding path program 1 times [2023-02-16 03:10:15,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:15,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272480085] [2023-02-16 03:10:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:15,428 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-16 03:10:15,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:15,429 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-16 03:10:15,432 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-16 03:10:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:15,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:10:15,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:15,515 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-16 03:10:15,552 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-16 03:10:15,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:15,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:15,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272480085] [2023-02-16 03:10:15,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272480085] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:15,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:15,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:10:15,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423373684] [2023-02-16 03:10:15,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:15,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:10:15,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:15,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:10:15,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:10:15,554 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:15,740 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2023-02-16 03:10:15,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:10:15,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-16 03:10:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:15,741 INFO L225 Difference]: With dead ends: 114 [2023-02-16 03:10:15,741 INFO L226 Difference]: Without dead ends: 114 [2023-02-16 03:10:15,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:10:15,742 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 49 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:15,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 226 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:10:15,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-16 03:10:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2023-02-16 03:10:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 95 states have internal predecessors, (110), 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-16 03:10:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2023-02-16 03:10:15,745 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 17 [2023-02-16 03:10:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:15,746 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2023-02-16 03:10:15,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2023-02-16 03:10:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:10:15,746 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:15,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:15,754 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-16 03:10:15,954 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-16 03:10:15,954 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting list_add_tailErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:15,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1605856062, now seen corresponding path program 1 times [2023-02-16 03:10:15,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:15,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955325989] [2023-02-16 03:10:15,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:15,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:10:15,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:15,956 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-16 03:10:15,956 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-16 03:10:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:16,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:10:16,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:16,043 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-16 03:10:16,088 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-16 03:10:16,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:16,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:16,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955325989] [2023-02-16 03:10:16,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955325989] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:16,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:16,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:10:16,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503730421] [2023-02-16 03:10:16,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:16,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:10:16,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:16,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:10:16,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:10:16,091 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:16,318 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2023-02-16 03:10:16,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:10:16,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-16 03:10:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:16,320 INFO L225 Difference]: With dead ends: 112 [2023-02-16 03:10:16,320 INFO L226 Difference]: Without dead ends: 112 [2023-02-16 03:10:16,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:10:16,321 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 36 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:16,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 246 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:10:16,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-16 03:10:16,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2023-02-16 03:10:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 95 states have internal predecessors, (106), 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-16 03:10:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2023-02-16 03:10:16,325 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 17 [2023-02-16 03:10:16,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:16,326 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2023-02-16 03:10:16,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2023-02-16 03:10:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 03:10:16,327 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:16,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:16,336 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-16 03:10:16,527 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-16 03:10:16,528 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:16,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1334414076, now seen corresponding path program 1 times [2023-02-16 03:10:16,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:16,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854374680] [2023-02-16 03:10:16,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:16,528 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-16 03:10:16,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:16,529 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-16 03:10:16,530 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-16 03:10:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:16,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 03:10:16,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:16,692 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-16 03:10:16,711 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-16 03:10:16,729 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-16 03:10:16,759 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:16,759 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-16 03:10:16,786 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 16 treesize of output 18 [2023-02-16 03:10:16,834 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 7 [2023-02-16 03:10:16,865 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-16 03:10:16,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:16,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:16,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854374680] [2023-02-16 03:10:16,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854374680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:16,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:16,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 03:10:16,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727685995] [2023-02-16 03:10:16,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:16,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:10:16,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:16,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:10:16,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:10:16,866 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:17,472 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2023-02-16 03:10:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:10:17,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-16 03:10:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:17,474 INFO L225 Difference]: With dead ends: 162 [2023-02-16 03:10:17,474 INFO L226 Difference]: Without dead ends: 162 [2023-02-16 03:10:17,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2023-02-16 03:10:17,475 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 80 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:17,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 356 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:10:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-16 03:10:17,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 128. [2023-02-16 03:10:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 115 states have internal predecessors, (130), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 03:10:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2023-02-16 03:10:17,479 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 19 [2023-02-16 03:10:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:17,479 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2023-02-16 03:10:17,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2023-02-16 03:10:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 03:10:17,479 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:17,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:17,490 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-16 03:10:17,680 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-16 03:10:17,680 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:17,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:17,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1334414075, now seen corresponding path program 1 times [2023-02-16 03:10:17,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:17,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023630572] [2023-02-16 03:10:17,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:17,681 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-16 03:10:17,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:17,682 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-16 03:10:17,685 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-16 03:10:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:17,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-16 03:10:17,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:17,864 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-16 03:10:17,869 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-16 03:10:17,915 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-16 03:10:17,923 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-16 03:10:17,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:17,964 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-16 03:10:17,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:17,982 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-16 03:10:17,998 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:17,999 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-16 03:10:18,011 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-16 03:10:18,050 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 14 treesize of output 16 [2023-02-16 03:10:18,057 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 14 treesize of output 16 [2023-02-16 03:10:18,135 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-16 03:10:18,139 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-16 03:10:18,185 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-16 03:10:18,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:18,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:18,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023630572] [2023-02-16 03:10:18,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023630572] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:18,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:18,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 03:10:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987823247] [2023-02-16 03:10:18,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:18,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:10:18,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:18,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:10:18,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:10:18,186 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:18,894 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2023-02-16 03:10:18,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:10:18,895 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-16 03:10:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:18,896 INFO L225 Difference]: With dead ends: 131 [2023-02-16 03:10:18,896 INFO L226 Difference]: Without dead ends: 131 [2023-02-16 03:10:18,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2023-02-16 03:10:18,896 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 33 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:18,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 426 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:10:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-16 03:10:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-02-16 03:10:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 118 states have internal predecessors, (131), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 03:10:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2023-02-16 03:10:18,900 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 19 [2023-02-16 03:10:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:18,900 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2023-02-16 03:10:18,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2023-02-16 03:10:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:10:18,900 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:18,900 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-16 03:10:18,911 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-16 03:10:19,101 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-16 03:10:19,101 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:19,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1965497160, now seen corresponding path program 1 times [2023-02-16 03:10:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:19,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746524515] [2023-02-16 03:10:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:19,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:10:19,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:19,103 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-16 03:10:19,105 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-16 03:10:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:19,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 03:10:19,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:19,258 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-16 03:10:19,263 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-16 03:10:19,321 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_448 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_448))) (= (_ bv0 1) (select |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base|)))) is different from true [2023-02-16 03:10:19,348 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-16 03:10:19,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:19,397 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-16 03:10:19,403 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:19,403 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-16 03:10:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:19,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:19,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:19,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746524515] [2023-02-16 03:10:19,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746524515] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:19,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1428503610] [2023-02-16 03:10:19,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:19,780 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:10:19,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:10:19,794 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:10:19,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-02-16 03:10:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:20,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-16 03:10:20,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:20,107 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-16 03:10:20,111 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-16 03:10:20,231 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-16 03:10:20,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:20,433 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-16 03:10:20,441 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:20,441 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-16 03:10:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:20,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:20,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1428503610] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:20,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:20,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 13 [2023-02-16 03:10:20,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080357638] [2023-02-16 03:10:20,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:20,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:10:20,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:20,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:10:20,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=263, Unknown=3, NotChecked=32, Total=342 [2023-02-16 03:10:20,942 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:10:23,509 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-16 03:10:27,576 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-16 03:10:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:30,077 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2023-02-16 03:10:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:10:30,078 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2023-02-16 03:10:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:30,079 INFO L225 Difference]: With dead ends: 146 [2023-02-16 03:10:30,079 INFO L226 Difference]: Without dead ends: 146 [2023-02-16 03:10:30,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=80, Invalid=471, Unknown=5, NotChecked=44, Total=600 [2023-02-16 03:10:30,079 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 65 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:30,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 394 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 412 Invalid, 2 Unknown, 90 Unchecked, 4.8s Time] [2023-02-16 03:10:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-16 03:10:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2023-02-16 03:10:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.393939393939394) internal successors, (138), 123 states have internal predecessors, (138), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-16 03:10:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2023-02-16 03:10:30,083 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 29 [2023-02-16 03:10:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:30,083 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2023-02-16 03:10:30,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:10:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2023-02-16 03:10:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:10:30,084 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:30,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:30,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2023-02-16 03:10:30,296 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-16 03:10:30,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 03:10:30,488 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:30,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1572542800, now seen corresponding path program 1 times [2023-02-16 03:10:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:30,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896006966] [2023-02-16 03:10:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:30,489 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-16 03:10:30,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:30,490 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-16 03:10:30,491 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-16 03:10:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:30,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-16 03:10:30,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:30,743 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-16 03:10:30,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:30,896 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-16 03:10:30,908 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:30,908 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-16 03:10:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:30,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:35,950 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 98 treesize of output 94 [2023-02-16 03:10:35,993 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-02-16 03:10:35,994 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 80 treesize of output 97 [2023-02-16 03:10:36,411 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:10:36,411 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 15 treesize of output 14 [2023-02-16 03:10:36,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:36,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896006966] [2023-02-16 03:10:36,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896006966] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:36,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [639313691] [2023-02-16 03:10:36,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:36,536 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:10:36,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:10:36,537 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:10:36,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-02-16 03:10:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:36,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-16 03:10:36,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:36,939 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-16 03:10:36,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 5 [2023-02-16 03:10:37,256 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-16 03:10:37,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:37,467 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-16 03:10:37,477 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:37,478 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-16 03:10:37,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:37,679 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-16 03:10:37,687 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:37,687 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-16 03:10:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:37,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:44,332 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:10:44,333 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 44 treesize of output 68 [2023-02-16 03:10:44,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [639313691] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:44,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:44,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2023-02-16 03:10:44,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961790048] [2023-02-16 03:10:44,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:44,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 03:10:44,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:44,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 03:10:44,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1280, Unknown=4, NotChecked=0, Total=1406 [2023-02-16 03:10:44,867 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand has 26 states, 24 states have (on average 2.125) internal successors, (51), 20 states have internal predecessors, (51), 7 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:10:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:47,443 INFO L93 Difference]: Finished difference Result 250 states and 272 transitions. [2023-02-16 03:10:47,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 03:10:47,443 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.125) internal successors, (51), 20 states have internal predecessors, (51), 7 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2023-02-16 03:10:47,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:47,444 INFO L225 Difference]: With dead ends: 250 [2023-02-16 03:10:47,444 INFO L226 Difference]: Without dead ends: 250 [2023-02-16 03:10:47,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=374, Invalid=2928, Unknown=4, NotChecked=0, Total=3306 [2023-02-16 03:10:47,446 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 387 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 84 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:47,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 496 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1024 Invalid, 2 Unknown, 0 Unchecked, 1.5s Time] [2023-02-16 03:10:47,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-02-16 03:10:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 167. [2023-02-16 03:10:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 148 states have internal predecessors, (166), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (11), 8 states have call predecessors, (11), 10 states have call successors, (11) [2023-02-16 03:10:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2023-02-16 03:10:47,450 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 36 [2023-02-16 03:10:47,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:47,450 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2023-02-16 03:10:47,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.125) internal successors, (51), 20 states have internal predecessors, (51), 7 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:10:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2023-02-16 03:10:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 03:10:47,451 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:47,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:47,461 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-16 03:10:47,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-02-16 03:10:47,858 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:10:47,859 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:10:47,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:47,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1746009876, now seen corresponding path program 1 times [2023-02-16 03:10:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:47,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081564142] [2023-02-16 03:10:47,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:47,860 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-16 03:10:47,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:47,861 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-16 03:10:47,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 (19)] Waiting until timeout for monitored process [2023-02-16 03:10:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:48,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 75 conjunts are in the unsatisfiable core [2023-02-16 03:10:48,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:48,254 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-16 03:10:48,298 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-16 03:10:48,304 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-16 03:10:48,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:48,336 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-16 03:10:48,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:48,343 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-16 03:10:48,386 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:10:48,386 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-16 03:10:48,475 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 16 treesize of output 18 [2023-02-16 03:10:48,490 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 16 treesize of output 18 [2023-02-16 03:10:48,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-16 03:10:48,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-16 03:10:49,434 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 36 [2023-02-16 03:10:49,482 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-16 03:10:49,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 128 [2023-02-16 03:10:49,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 44 treesize of output 26 [2023-02-16 03:10:49,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:49,495 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 120 treesize of output 84 [2023-02-16 03:10:49,715 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-16 03:10:49,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2023-02-16 03:10:49,905 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:10:49,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 91 [2023-02-16 03:10:49,914 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:10:49,922 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:10:50,150 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 15 [2023-02-16 03:10:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:50,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:50,751 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_810) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd |c_create_sub_list_insert_sub_~head#1.offset| (_ bv4 32)))) (_ bv1 1)))) is different from false [2023-02-16 03:10:50,770 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_24| (_ BitVec 32)) (v_ArrVal_809 (_ BitVec 1)) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_24| v_ArrVal_809) (select (select (store |c_#memory_$Pointer$.base| |v_create_sub_list_insert_sub_~sub~0#1.base_24| v_ArrVal_810) |c_create_sub_list_~sub#1.base|) (bvadd |c_create_sub_list_~sub#1.offset| (_ bv4 32)))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_24|))))) is different from false [2023-02-16 03:10:51,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:51,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081564142] [2023-02-16 03:10:51,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081564142] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:51,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [714729518] [2023-02-16 03:10:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:51,687 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:10:51,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:10:51,688 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:10:51,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-02-16 03:10:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:52,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-16 03:10:52,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:52,303 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-16 03:10:52,327 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-16 03:10:52,334 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-16 03:10:52,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:52,357 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-16 03:10:52,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:52,363 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-16 03:10:52,402 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:10:52,403 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-16 03:10:52,444 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 16 treesize of output 18 [2023-02-16 03:10:52,462 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 16 treesize of output 18 [2023-02-16 03:10:52,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-16 03:10:52,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-16 03:10:53,033 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 36 [2023-02-16 03:10:53,086 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-16 03:10:53,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 128 [2023-02-16 03:10:53,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 44 treesize of output 26 [2023-02-16 03:10:53,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:53,096 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 120 treesize of output 84 [2023-02-16 03:10:53,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 22 [2023-02-16 03:10:53,266 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-16 03:10:53,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2023-02-16 03:10:53,387 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 34 treesize of output 32 [2023-02-16 03:10:53,414 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 15 [2023-02-16 03:10:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:53,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:55,678 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_27| (_ BitVec 32)) (v_ArrVal_931 (_ BitVec 1)) (v_ArrVal_932 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_27|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_27| v_ArrVal_931) (select (select (store |c_#memory_$Pointer$.base| |v_create_sub_list_insert_sub_~sub~0#1.base_27| v_ArrVal_932) |c_create_sub_list_~sub#1.base|) (bvadd |c_create_sub_list_~sub#1.offset| (_ bv4 32)))) (_ bv1 1))))) is different from false [2023-02-16 03:10:56,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [714729518] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:56,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:56,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2023-02-16 03:10:56,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925117654] [2023-02-16 03:10:56,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:56,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 03:10:56,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:56,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 03:10:56,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=893, Unknown=19, NotChecked=186, Total=1190 [2023-02-16 03:10:56,534 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:11:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:11:01,773 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2023-02-16 03:11:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 03:11:01,773 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-02-16 03:11:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:11:01,774 INFO L225 Difference]: With dead ends: 182 [2023-02-16 03:11:01,774 INFO L226 Difference]: Without dead ends: 182 [2023-02-16 03:11:01,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 53 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=244, Invalid=2071, Unknown=49, NotChecked=288, Total=2652 [2023-02-16 03:11:01,775 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 51 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 17 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:11:01,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 833 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 978 Invalid, 21 Unknown, 0 Unchecked, 3.1s Time] [2023-02-16 03:11:01,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-16 03:11:01,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2023-02-16 03:11:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 161 states have internal predecessors, (179), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2023-02-16 03:11:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 202 transitions. [2023-02-16 03:11:01,780 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 202 transitions. Word has length 35 [2023-02-16 03:11:01,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:11:01,780 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 202 transitions. [2023-02-16 03:11:01,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:11:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 202 transitions. [2023-02-16 03:11:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 03:11:01,781 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:11:01,781 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:11:01,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-02-16 03:11:01,994 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-16 03:11:02,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 03:11:02,186 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:11:02,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:11:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1746009877, now seen corresponding path program 1 times [2023-02-16 03:11:02,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:11:02,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150320724] [2023-02-16 03:11:02,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:11:02,187 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-16 03:11:02,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:11:02,188 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-16 03:11:02,191 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-16 03:11:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:11:02,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-16 03:11:02,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:11:02,571 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-16 03:11:02,608 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-16 03:11:02,613 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-16 03:11:02,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:02,637 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-16 03:11:02,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:02,643 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-16 03:11:02,678 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:11:02,678 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-16 03:11:02,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:11:02,775 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 16 treesize of output 18 [2023-02-16 03:11:02,787 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 16 treesize of output 18 [2023-02-16 03:11:02,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-16 03:11:02,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-16 03:11:04,141 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 79 [2023-02-16 03:11:04,235 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-16 03:11:04,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 188 [2023-02-16 03:11:04,242 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 60 [2023-02-16 03:11:04,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:04,247 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 154 treesize of output 106 [2023-02-16 03:11:04,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:04,262 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 30 treesize of output 27 [2023-02-16 03:11:04,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:04,265 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 16 treesize of output 20 [2023-02-16 03:11:04,491 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:11:04,491 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 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-16 03:11:04,516 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-16 03:11:04,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-02-16 03:11:04,697 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:11:04,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 89 [2023-02-16 03:11:04,700 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:11:04,707 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:11:04,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:11:05,019 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-16 03:11:05,021 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 13 [2023-02-16 03:11:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:11:05,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:11:05,948 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_create_sub_list_insert_sub_~head#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_1062 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1062) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1062 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1062) |c_create_sub_list_insert_sub_~head#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1061) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)))))) is different from false [2023-02-16 03:11:14,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:11:14,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150320724] [2023-02-16 03:11:14,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150320724] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:11:14,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1016034854] [2023-02-16 03:11:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:11:14,172 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:11:14,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:11:14,173 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:11:14,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-02-16 03:11:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:11:15,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 99 conjunts are in the unsatisfiable core [2023-02-16 03:11:15,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:11:15,012 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-16 03:11:15,031 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-16 03:11:15,038 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-16 03:11:15,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:15,051 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-16 03:11:15,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:15,068 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-16 03:11:15,101 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:11:15,101 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-16 03:11:15,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:11:15,157 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 16 treesize of output 18 [2023-02-16 03:11:15,183 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 16 treesize of output 18 [2023-02-16 03:11:15,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-16 03:11:15,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-16 03:11:19,039 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 91 [2023-02-16 03:11:19,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:19,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-02-16 03:11:19,066 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 45 [2023-02-16 03:11:19,110 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2023-02-16 03:11:19,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 125 [2023-02-16 03:11:19,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:19,116 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 129 treesize of output 89 [2023-02-16 03:11:19,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 22 [2023-02-16 03:11:19,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:19,154 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 16 treesize of output 20 [2023-02-16 03:11:19,542 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:11:19,542 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 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-16 03:11:19,571 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-16 03:11:19,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-02-16 03:11:19,761 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 32 treesize of output 30 [2023-02-16 03:11:19,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:11:19,792 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-16 03:11:19,796 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 13 [2023-02-16 03:11:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:11:20,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:11:20,088 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_create_sub_list_insert_sub_~head#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_1201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1202 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1202) |c_create_sub_list_insert_sub_~head#1.base|) .cse0) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1201) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_1202 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1202) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) is different from false [2023-02-16 03:11:28,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1016034854] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:11:28,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:11:28,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2023-02-16 03:11:28,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753494906] [2023-02-16 03:11:28,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:11:28,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 03:11:28,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:11:28,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 03:11:28,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1418, Unknown=30, NotChecked=154, Total=1722 [2023-02-16 03:11:28,393 INFO L87 Difference]: Start difference. First operand 181 states and 202 transitions. Second operand has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:11:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:11:41,417 INFO L93 Difference]: Finished difference Result 181 states and 201 transitions. [2023-02-16 03:11:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 03:11:41,417 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-02-16 03:11:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:11:41,418 INFO L225 Difference]: With dead ends: 181 [2023-02-16 03:11:41,418 INFO L226 Difference]: Without dead ends: 181 [2023-02-16 03:11:41,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=221, Invalid=2401, Unknown=38, NotChecked=202, Total=2862 [2023-02-16 03:11:41,419 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 49 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 16 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:11:41,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 892 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1144 Invalid, 17 Unknown, 0 Unchecked, 4.9s Time] [2023-02-16 03:11:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-16 03:11:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2023-02-16 03:11:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 161 states have internal predecessors, (178), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2023-02-16 03:11:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2023-02-16 03:11:41,423 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 35 [2023-02-16 03:11:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:11:41,423 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2023-02-16 03:11:41,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:11:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2023-02-16 03:11:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:11:41,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:11:41,424 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:11:41,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-02-16 03:11:41,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-16 03:11:41,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 03:11:41,830 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting list_add_tailErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:11:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:11:41,830 INFO L85 PathProgramCache]: Analyzing trace with hash -614855375, now seen corresponding path program 1 times [2023-02-16 03:11:41,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:11:41,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801201244] [2023-02-16 03:11:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:11:41,831 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-16 03:11:41,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:11:41,832 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-16 03:11:41,832 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-16 03:11:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:11:42,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:11:42,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:11:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:11:42,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:11:42,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:11:42,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801201244] [2023-02-16 03:11:42,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801201244] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:11:42,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:11:42,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 03:11:42,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631675079] [2023-02-16 03:11:42,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:11:42,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:11:42,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:11:42,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:11:42,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:11:42,114 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:11:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:11:42,448 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2023-02-16 03:11:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:11:42,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-02-16 03:11:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:11:42,450 INFO L225 Difference]: With dead ends: 184 [2023-02-16 03:11:42,450 INFO L226 Difference]: Without dead ends: 184 [2023-02-16 03:11:42,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:11:42,451 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 99 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:11:42,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 552 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:11:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-16 03:11:42,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2023-02-16 03:11:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 136 states have (on average 1.2794117647058822) internal successors, (174), 161 states have internal predecessors, (174), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2023-02-16 03:11:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2023-02-16 03:11:42,456 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 38 [2023-02-16 03:11:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:11:42,456 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2023-02-16 03:11:42,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:11:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2023-02-16 03:11:42,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:11:42,457 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:11:42,457 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:11:42,482 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-16 03:11:42,657 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-16 03:11:42,658 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:11:42,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:11:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash 879107445, now seen corresponding path program 1 times [2023-02-16 03:11:42,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:11:42,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485683669] [2023-02-16 03:11:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:11:42,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-16 03:11:42,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:11:42,659 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-16 03:11:42,660 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-16 03:11:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:11:42,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-16 03:11:42,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:11:43,123 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-16 03:11:43,130 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-16 03:11:43,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:43,167 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-16 03:11:43,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:43,176 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-16 03:11:43,188 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:11:43,188 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-16 03:11:43,236 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 14 treesize of output 16 [2023-02-16 03:11:43,241 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 14 treesize of output 16 [2023-02-16 03:11:43,337 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-16 03:11:43,342 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-16 03:11:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:11:43,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:11:43,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:11:43,602 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 46 treesize of output 50 [2023-02-16 03:11:44,072 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_create_sub_list_insert_sub_~head#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1424) |c_create_sub_list_insert_sub_~head#1.base|) .cse0) (_ bv4 32)) (bvadd |c_create_sub_list_insert_sub_~head#1.offset| (_ bv8 32)))) (forall ((v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1424) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))) (forall ((v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1423) |c_create_sub_list_insert_sub_~head#1.base|) .cse0) |c_create_sub_list_insert_sub_~head#1.base|)))) is different from false [2023-02-16 03:11:48,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:11:48,800 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2023-02-16 03:11:48,803 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 50 treesize of output 32 [2023-02-16 03:11:48,808 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 17 treesize of output 9 [2023-02-16 03:11:48,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:11:48,835 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2023-02-16 03:11:48,838 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:11:48,840 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 24 treesize of output 12 [2023-02-16 03:11:48,857 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-16 03:11:48,857 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2023-02-16 03:11:49,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:11:49,609 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 44 treesize of output 66 [2023-02-16 03:11:49,825 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:11:49,826 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 16 treesize of output 15 [2023-02-16 03:11:49,850 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:11:49,850 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 16 treesize of output 15 [2023-02-16 03:11:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:11:49,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:11:49,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485683669] [2023-02-16 03:11:49,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485683669] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:11:49,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:11:49,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2023-02-16 03:11:49,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715115632] [2023-02-16 03:11:49,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:11:49,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-16 03:11:49,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:11:49,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-16 03:11:49,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=733, Unknown=7, NotChecked=54, Total=870 [2023-02-16 03:11:49,884 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand has 30 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:11:52,527 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 [1] [2023-02-16 03:11:54,530 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 [1] [2023-02-16 03:11:56,537 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 [1] [2023-02-16 03:11:58,539 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 [1] [2023-02-16 03:12:14,672 WARN L233 SmtUtils]: Spent 13.72s on a formula simplification. DAG size of input: 110 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:12:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:12:20,475 INFO L93 Difference]: Finished difference Result 236 states and 256 transitions. [2023-02-16 03:12:20,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-16 03:12:20,475 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2023-02-16 03:12:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:12:20,476 INFO L225 Difference]: With dead ends: 236 [2023-02-16 03:12:20,476 INFO L226 Difference]: Without dead ends: 236 [2023-02-16 03:12:20,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=292, Invalid=2254, Unknown=8, NotChecked=98, Total=2652 [2023-02-16 03:12:20,477 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 233 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 29 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:12:20,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 782 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1210 Invalid, 5 Unknown, 104 Unchecked, 13.0s Time] [2023-02-16 03:12:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-16 03:12:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 184. [2023-02-16 03:12:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 138 states have (on average 1.2681159420289856) internal successors, (175), 164 states have internal predecessors, (175), 11 states have call successors, (11), 11 states have call predecessors, (11), 11 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2023-02-16 03:12:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 198 transitions. [2023-02-16 03:12:20,481 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 198 transitions. Word has length 41 [2023-02-16 03:12:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:12:20,481 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 198 transitions. [2023-02-16 03:12:20,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:12:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 198 transitions. [2023-02-16 03:12:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 03:12:20,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:12:20,482 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:12:20,492 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-16 03:12:20,692 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-16 03:12:20,692 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:12:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:12:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1398479560, now seen corresponding path program 1 times [2023-02-16 03:12:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:12:20,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686025321] [2023-02-16 03:12:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:20,693 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-16 03:12:20,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:12:20,694 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-16 03:12:20,694 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-16 03:12:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:20,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-16 03:12:20,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:21,005 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-16 03:12:21,010 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-16 03:12:21,118 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-16 03:12:21,226 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:12:21,226 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-16 03:12:21,239 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1525 (_ BitVec 32)) (v_ArrVal_1526 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_41| (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_create_sub_list_insert_sub_~sub~0#1.base_41|)) (not (= |c_create_sub_list_#in~sub#1.base| |create_sub_list_insert_sub_~sub~0#1.base|)) (= |c_#length| (store (store |c_old(#length)| |v_create_sub_list_insert_sub_~sub~0#1.base_41| v_ArrVal_1525) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1526)))) is different from true [2023-02-16 03:12:21,276 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:12:21,277 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-16 03:12:21,280 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-16 03:12:21,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:21,355 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:12:21,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 23 [2023-02-16 03:12:21,371 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:12:21,371 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 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:12:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-02-16 03:12:21,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:12:21,811 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:12:21,811 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 15 treesize of output 14 [2023-02-16 03:12:26,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:12:26,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686025321] [2023-02-16 03:12:26,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686025321] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:12:26,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1575402685] [2023-02-16 03:12:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:26,085 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:12:26,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:12:26,086 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:12:26,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-02-16 03:12:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:26,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-16 03:12:26,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:26,626 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-16 03:12:26,630 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-16 03:12:26,809 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-16 03:12:26,934 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:12:26,935 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-16 03:12:27,078 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:12:27,078 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-16 03:12:27,081 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-16 03:12:27,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:27,462 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:12:27,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 23 [2023-02-16 03:12:27,476 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:12:27,476 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 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:12:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:12:27,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:12:28,077 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:12:28,077 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 15 treesize of output 14 [2023-02-16 03:12:30,192 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv24 32))) (.cse0 (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv16 32)))) (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_54| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_54|))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_53| (_ BitVec 32))) (or (forall ((v_ArrVal_1639 (_ BitVec 32)) (v_ArrVal_1640 (_ BitVec 32))) (let ((.cse1 (select (store (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_54| v_ArrVal_1640) |v_create_sub_list_insert_sub_~sub~0#1.base_53| v_ArrVal_1639) |c_ULTIMATE.start_insert_top_~top~0#1.base|))) (or (not (bvule .cse0 .cse1)) (bvule .cse2 .cse1)))) (= |c_ULTIMATE.start_insert_top_~top~0#1.base| |v_create_sub_list_insert_sub_~sub~0#1.base_53|))))) (or (bvule (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv20 32)) .cse2) (forall ((v_ArrVal_1639 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_53| (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_54| (_ BitVec 32)) (v_ArrVal_1640 (_ BitVec 32))) (or (not (bvule .cse0 (select (store (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_54| v_ArrVal_1640) |v_create_sub_list_insert_sub_~sub~0#1.base_53| v_ArrVal_1639) |c_ULTIMATE.start_insert_top_~top~0#1.base|))) (= |c_ULTIMATE.start_insert_top_~top~0#1.base| |v_create_sub_list_insert_sub_~sub~0#1.base_53|) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_54|)))))))) is different from false [2023-02-16 03:12:30,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1575402685] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:12:30,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:12:30,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 21 [2023-02-16 03:12:30,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179764444] [2023-02-16 03:12:30,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:12:30,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 03:12:30,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:12:30,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 03:12:30,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=537, Unknown=6, NotChecked=94, Total=702 [2023-02-16 03:12:30,199 INFO L87 Difference]: Start difference. First operand 184 states and 198 transitions. Second operand has 22 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:12:32,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:12:45,950 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-16 03:12:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:12:49,795 INFO L93 Difference]: Finished difference Result 300 states and 331 transitions. [2023-02-16 03:12:49,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 03:12:49,796 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2023-02-16 03:12:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:12:49,798 INFO L225 Difference]: With dead ends: 300 [2023-02-16 03:12:49,798 INFO L226 Difference]: Without dead ends: 300 [2023-02-16 03:12:49,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=140, Invalid=1050, Unknown=8, NotChecked=134, Total=1332 [2023-02-16 03:12:49,798 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 207 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:12:49,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 521 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1022 Invalid, 1 Unknown, 103 Unchecked, 6.6s Time] [2023-02-16 03:12:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-02-16 03:12:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 191. [2023-02-16 03:12:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 143 states have (on average 1.2657342657342658) internal successors, (181), 168 states have internal predecessors, (181), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (14), 10 states have call predecessors, (14), 12 states have call successors, (14) [2023-02-16 03:12:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 207 transitions. [2023-02-16 03:12:49,803 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 207 transitions. Word has length 45 [2023-02-16 03:12:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:12:49,804 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 207 transitions. [2023-02-16 03:12:49,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:12:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 207 transitions. [2023-02-16 03:12:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 03:12:49,805 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:12:49,805 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:12:49,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-02-16 03:12:50,022 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-16 03:12:50,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 03:12:50,213 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:12:50,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:12:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1768276039, now seen corresponding path program 1 times [2023-02-16 03:12:50,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:12:50,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122949736] [2023-02-16 03:12:50,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:50,213 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-16 03:12:50,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:12:50,215 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-16 03:12:50,216 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-16 03:12:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:50,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 03:12:50,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:50,559 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-16 03:12:50,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:50,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-16 03:12:50,614 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-16 03:12:50,701 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-16 03:12:50,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:50,799 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-16 03:12:50,812 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-16 03:12:50,857 WARN L859 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (bvadd |c_#StackHeapBarrier| (_ bv1 32)))) (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv1 1))))) (not (= (_ bv0 32) |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:12:50,890 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-16 03:12:51,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:51,112 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-16 03:12:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2023-02-16 03:12:51,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:12:51,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:12:51,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122949736] [2023-02-16 03:12:51,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122949736] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:12:51,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [955319656] [2023-02-16 03:12:51,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:51,363 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:12:51,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:12:51,363 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:12:51,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-02-16 03:12:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:52,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-16 03:12:52,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:52,788 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:12:52,788 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-16 03:12:52,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:52,883 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2023-02-16 03:12:52,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 36 [2023-02-16 03:12:52,989 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:12:52,989 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 24 treesize of output 20 [2023-02-16 03:12:53,090 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-16 03:12:53,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:53,217 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2023-02-16 03:12:53,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 45 [2023-02-16 03:12:53,263 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:12:53,263 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 24 treesize of output 20 [2023-02-16 03:12:53,365 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-16 03:12:53,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:53,485 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2023-02-16 03:12:53,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 45 [2023-02-16 03:12:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-16 03:12:53,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:12:54,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [955319656] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:12:54,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:12:54,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2023-02-16 03:12:54,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450453381] [2023-02-16 03:12:54,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:12:54,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 03:12:54,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:12:54,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 03:12:54,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=429, Unknown=7, NotChecked=42, Total=552 [2023-02-16 03:12:54,008 INFO L87 Difference]: Start difference. First operand 191 states and 207 transitions. Second operand has 19 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:12:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:12:56,596 INFO L93 Difference]: Finished difference Result 287 states and 316 transitions. [2023-02-16 03:12:56,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:12:56,596 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-02-16 03:12:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:12:56,597 INFO L225 Difference]: With dead ends: 287 [2023-02-16 03:12:56,597 INFO L226 Difference]: Without dead ends: 287 [2023-02-16 03:12:56,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=144, Invalid=659, Unknown=13, NotChecked=54, Total=870 [2023-02-16 03:12:56,598 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 486 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 78 mSolverCounterUnsat, 152 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 152 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:12:56,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 406 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 697 Invalid, 152 Unknown, 110 Unchecked, 2.1s Time] [2023-02-16 03:12:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-02-16 03:12:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 212. [2023-02-16 03:12:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 159 states have (on average 1.2955974842767295) internal successors, (206), 184 states have internal predecessors, (206), 15 states have call successors, (15), 13 states have call predecessors, (15), 14 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2023-02-16 03:12:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 242 transitions. [2023-02-16 03:12:56,603 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 242 transitions. Word has length 51 [2023-02-16 03:12:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:12:56,603 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 242 transitions. [2023-02-16 03:12:56,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:12:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 242 transitions. [2023-02-16 03:12:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 03:12:56,604 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:12:56,604 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:12:56,616 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-16 03:12:56,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2023-02-16 03:12:57,014 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,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:12:57,014 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:12:57,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:12:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1768276040, now seen corresponding path program 1 times [2023-02-16 03:12:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:12:57,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923800914] [2023-02-16 03:12:57,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:57,015 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-16 03:12:57,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:12:57,016 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-16 03:12:57,016 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-16 03:12:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:57,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-16 03:12:57,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:57,341 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-16 03:12:57,349 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-16 03:12:57,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:57,373 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-16 03:12:57,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:57,382 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 13 treesize of output 9 [2023-02-16 03:12:57,418 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-16 03:12:57,461 WARN L859 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (bvadd |c_#StackHeapBarrier| (_ bv1 32)))) (not (= (_ bv0 32) |c_#StackHeapBarrier|)) (exists ((v_ArrVal_1986 (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1986))))) is different from true [2023-02-16 03:12:57,492 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-16 03:12:57,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:57,593 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-16 03:12:57,612 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-16 03:12:57,641 WARN L859 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (bvadd |c_#StackHeapBarrier| (_ bv1 32)))) (not (= (_ bv0 32) |c_#StackHeapBarrier|)) (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv12 32)))))) is different from true [2023-02-16 03:12:57,663 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-16 03:12:57,764 WARN L859 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (bvadd |c_#StackHeapBarrier| (_ bv1 32)))) (not (= (_ bv0 32) |c_#StackHeapBarrier|)) (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv12 32))))) (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#length| |create_sub_list_insert_sub_~sub~0#1.base|) (_ bv12 32))))) is different from true [2023-02-16 03:12:57,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:57,849 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-16 03:12:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2023-02-16 03:12:58,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:12:58,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:12:58,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923800914] [2023-02-16 03:12:58,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923800914] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:12:58,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2045171193] [2023-02-16 03:12:58,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:58,340 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:12:58,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:12:58,341 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:12:58,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-02-16 03:12:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:59,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-16 03:12:59,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:59,503 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-16 03:12:59,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:59,573 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-16 03:12:59,602 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-16 03:12:59,727 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-16 03:12:59,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:59,807 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-16 03:12:59,824 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-16 03:12:59,853 WARN L859 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (bvadd |c_#StackHeapBarrier| (_ bv1 32)))) (not (= (_ bv0 32) |c_#StackHeapBarrier|)) (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32)) (v_ArrVal_2102 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2102)) (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|)))) is different from true [2023-02-16 03:12:59,877 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-16 03:12:59,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:59,954 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-16 03:13:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 7 not checked. [2023-02-16 03:13:00,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:03,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2045171193] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:13:03,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:13:03,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2023-02-16 03:13:03,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730684887] [2023-02-16 03:13:03,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:13:03,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 03:13:03,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:13:03,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 03:13:03,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=322, Unknown=7, NotChecked=156, Total=552 [2023-02-16 03:13:03,044 INFO L87 Difference]: Start difference. First operand 212 states and 242 transitions. Second operand has 19 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:13:05,424 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-16 03:13:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:13:13,226 INFO L93 Difference]: Finished difference Result 274 states and 304 transitions. [2023-02-16 03:13:13,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:13:13,227 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 51 [2023-02-16 03:13:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:13:13,228 INFO L225 Difference]: With dead ends: 274 [2023-02-16 03:13:13,228 INFO L226 Difference]: Without dead ends: 274 [2023-02-16 03:13:13,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=146, Invalid=613, Unknown=13, NotChecked=220, Total=992 [2023-02-16 03:13:13,228 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 312 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 32 mSolverCounterUnsat, 107 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 107 IncrementalHoareTripleChecker+Unknown, 407 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:13:13,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 380 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 596 Invalid, 107 Unknown, 407 Unchecked, 5.2s Time] [2023-02-16 03:13:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-02-16 03:13:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 223. [2023-02-16 03:13:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 168 states have (on average 1.2797619047619047) internal successors, (215), 193 states have internal predecessors, (215), 16 states have call successors, (16), 14 states have call predecessors, (16), 15 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2023-02-16 03:13:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2023-02-16 03:13:13,233 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 51 [2023-02-16 03:13:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:13:13,233 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2023-02-16 03:13:13,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:13:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2023-02-16 03:13:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 03:13:13,233 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:13:13,233 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:13:13,247 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-16 03:13:13,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2023-02-16 03:13:13,634 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,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:13:13,634 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:13:13,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:13:13,634 INFO L85 PathProgramCache]: Analyzing trace with hash 636971300, now seen corresponding path program 2 times [2023-02-16 03:13:13,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:13:13,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425049527] [2023-02-16 03:13:13,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:13:13,635 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-16 03:13:13,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:13:13,636 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-16 03:13:13,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-16 03:13:14,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:13:14,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:13:14,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 114 conjunts are in the unsatisfiable core [2023-02-16 03:13:14,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:14,206 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-16 03:13:14,247 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-16 03:13:14,252 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-16 03:13:14,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:14,278 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-16 03:13:14,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:14,284 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-16 03:13:14,308 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:13:14,308 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-16 03:13:14,363 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 16 treesize of output 18 [2023-02-16 03:13:14,377 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 16 treesize of output 18 [2023-02-16 03:13:14,965 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 36 [2023-02-16 03:13:15,005 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-16 03:13:15,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 117 [2023-02-16 03:13:15,011 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 121 treesize of output 89 [2023-02-16 03:13:15,017 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 42 treesize of output 24 [2023-02-16 03:13:15,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 30 [2023-02-16 03:13:15,118 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:13:15,119 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-16 03:13:15,204 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 17 treesize of output 19 [2023-02-16 03:13:15,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 8 treesize of output 4 [2023-02-16 03:13:16,101 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-02-16 03:13:16,130 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-02-16 03:13:16,130 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 46 [2023-02-16 03:13:16,268 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-16 03:13:16,299 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-16 03:13:16,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 36 [2023-02-16 03:13:16,423 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:13:16,423 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 26 treesize of output 30 [2023-02-16 03:13:16,431 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 16 treesize of output 12 [2023-02-16 03:13:16,846 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:13:16,847 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 11 treesize of output 11 [2023-02-16 03:13:16,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 44 treesize of output 32 [2023-02-16 03:13:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:13:17,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:19,774 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 24 treesize of output 22 [2023-02-16 03:13:19,792 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 14 treesize of output 10 [2023-02-16 03:13:23,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:13:23,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425049527] [2023-02-16 03:13:23,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425049527] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:13:23,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2080995383] [2023-02-16 03:13:23,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:13:23,191 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:13:23,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:13:23,192 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:13:23,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-02-16 03:13:23,709 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 03:13:23,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760439760] [2023-02-16 03:13:23,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:13:23,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:13:23,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:13:23,712 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:13:23,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-02-16 03:13:23,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 1 [2023-02-16 03:13:24,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:13:24,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:13:24,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 118 conjunts are in the unsatisfiable core [2023-02-16 03:13:24,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:24,967 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-16 03:13:24,973 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-16 03:13:25,419 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-16 03:13:25,430 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-16 03:13:25,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:25,607 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-16 03:13:25,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:25,619 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-16 03:13:25,628 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 13 treesize of output 9 [2023-02-16 03:13:25,666 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:13:25,666 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-16 03:13:25,698 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 16 treesize of output 18 [2023-02-16 03:13:25,716 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 16 treesize of output 18 [2023-02-16 03:13:26,186 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 36 [2023-02-16 03:13:26,242 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-16 03:13:26,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 117 [2023-02-16 03:13:26,247 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 121 treesize of output 89 [2023-02-16 03:13:26,253 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 42 treesize of output 24 [2023-02-16 03:13:26,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 30 [2023-02-16 03:13:26,318 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:13:26,319 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-16 03:13:26,368 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 17 treesize of output 19 [2023-02-16 03:13:26,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 8 treesize of output 4 [2023-02-16 03:13:27,185 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-02-16 03:13:27,227 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-02-16 03:13:27,227 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 46 [2023-02-16 03:13:27,328 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-16 03:13:27,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2023-02-16 03:13:27,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:13:27,546 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 34 treesize of output 32 [2023-02-16 03:13:27,900 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-16 03:13:27,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 35 treesize of output 19 [2023-02-16 03:13:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:13:28,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:30,398 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 24 treesize of output 22 [2023-02-16 03:13:34,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760439760] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:13:34,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:13:34,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 39 [2023-02-16 03:13:34,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292150932] [2023-02-16 03:13:34,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:13:34,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-16 03:13:34,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:13:34,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-16 03:13:34,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2238, Unknown=74, NotChecked=0, Total=2450 [2023-02-16 03:13:34,504 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand has 40 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 34 states have internal predecessors, (56), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:13:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:13:48,550 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2023-02-16 03:13:48,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-16 03:13:48,550 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 34 states have internal predecessors, (56), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2023-02-16 03:13:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:13:48,551 INFO L225 Difference]: With dead ends: 225 [2023-02-16 03:13:48,551 INFO L226 Difference]: Without dead ends: 225 [2023-02-16 03:13:48,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 68 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=454, Invalid=5269, Unknown=129, NotChecked=0, Total=5852 [2023-02-16 03:13:48,553 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 82 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 2183 mSolverCounterSat, 35 mSolverCounterUnsat, 73 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 2291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2183 IncrementalHoareTripleChecker+Invalid, 73 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:13:48,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1473 Invalid, 2291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2183 Invalid, 73 Unknown, 0 Unchecked, 8.3s Time] [2023-02-16 03:13:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-16 03:13:48,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2023-02-16 03:13:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 168 states have (on average 1.2738095238095237) internal successors, (214), 193 states have internal predecessors, (214), 16 states have call successors, (16), 14 states have call predecessors, (16), 15 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2023-02-16 03:13:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 252 transitions. [2023-02-16 03:13:48,557 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 252 transitions. Word has length 51 [2023-02-16 03:13:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:13:48,557 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 252 transitions. [2023-02-16 03:13:48,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 34 states have internal predecessors, (56), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:13:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 252 transitions. [2023-02-16 03:13:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 03:13:48,558 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:13:48,558 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:13:48,582 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-16 03:13:48,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-02-16 03:13:48,966 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,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:13:48,966 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-16 03:13:48,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:13:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash 636971301, now seen corresponding path program 2 times [2023-02-16 03:13:48,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:13:48,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250648090] [2023-02-16 03:13:48,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:13:48,967 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-16 03:13:48,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:13:48,968 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-16 03:13:48,970 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-16 03:13:49,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:13:49,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:13:49,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 126 conjunts are in the unsatisfiable core [2023-02-16 03:13:49,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:49,536 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-16 03:13:49,587 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-16 03:13:49,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:49,617 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-16 03:13:49,632 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:13:49,632 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-16 03:13:49,679 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 16 treesize of output 18 [2023-02-16 03:13:49,839 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-16 03:13:49,908 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:13:49,908 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 16 treesize of output 22 [2023-02-16 03:13:49,917 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 3 [2023-02-16 03:13:49,996 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:13:49,996 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 20 treesize of output 26 [2023-02-16 03:13:50,002 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:13:50,463 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-16 03:13:50,463 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 31 treesize of output 46 [2023-02-16 03:13:50,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 34 treesize of output 22 [2023-02-16 03:13:50,641 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:13:50,641 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-16 03:13:50,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:13:50,744 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 17 treesize of output 19 [2023-02-16 03:13:50,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 8 treesize of output 4 [2023-02-16 03:13:51,160 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-16 03:13:51,281 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:13:51,281 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 16 treesize of output 22 [2023-02-16 03:13:51,290 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 3 [2023-02-16 03:13:51,440 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:13:51,441 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 20 treesize of output 26 [2023-02-16 03:13:51,446 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:13:51,595 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-16 03:13:51,596 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 26 treesize of output 38 [2023-02-16 03:13:51,605 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 3 [2023-02-16 03:13:51,783 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 39 [2023-02-16 03:13:51,812 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-02-16 03:13:51,813 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 75 [2023-02-16 03:13:51,991 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-16 03:13:51,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-02-16 03:13:52,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:13:52,117 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 14 treesize of output 16 [2023-02-16 03:13:52,128 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 32 treesize of output 30 [2023-02-16 03:13:52,440 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-16 03:13:52,448 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 17 [2023-02-16 03:13:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:13:52,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:55,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:13:55,190 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 60 [2023-02-16 03:13:55,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:13:55,219 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 474 treesize of output 455 [2023-02-16 03:13:55,227 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 438 treesize of output 374 [2023-02-16 03:13:55,234 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 374 treesize of output 342 [2023-02-16 03:13:55,252 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 178 treesize of output 162 [2023-02-16 03:13:58,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:13:58,069 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 75 [2023-02-16 03:13:58,072 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:13:58,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:13:58,101 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 248 treesize of output 247 [2023-02-16 03:13:58,110 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 230 treesize of output 222 [2023-02-16 03:13:58,127 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 112 treesize of output 108