./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 2329fc70 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-2329fc7 [2023-02-14 01:43:38,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:43:38,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:43:38,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:43:38,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:43:38,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:43:38,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:43:38,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:43:38,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:43:38,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:43:38,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:43:38,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:43:38,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:43:38,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:43:38,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:43:38,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:43:38,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:43:38,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:43:38,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:43:38,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:43:38,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:43:38,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:43:38,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:43:38,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:43:38,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:43:38,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:43:38,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:43:38,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:43:38,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:43:38,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:43:38,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:43:38,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:43:38,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:43:38,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:43:38,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:43:38,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:43:38,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:43:38,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:43:38,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:43:38,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:43:38,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:43:38,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 01:43:38,926 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:43:38,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:43:38,926 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:43:38,926 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:43:38,927 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:43:38,927 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:43:38,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:43:38,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:43:38,927 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:43:38,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:43:38,928 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:43:38,928 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:43:38,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:43:38,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:43:38,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:43:38,928 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:43:38,928 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:43:38,928 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:43:38,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:43:38,928 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:43:38,929 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:43:38,929 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:43:38,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:43:38,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:43:38,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:43:38,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:43:38,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:43:38,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:43:38,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 01:43:38,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 01:43:38,930 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:43:38,930 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:43:38,930 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:43:38,930 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:43:38,930 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-14 01:43:39,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:43:39,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:43:39,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:43:39,121 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:43:39,122 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:43:39,123 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-14 01:43:40,077 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:43:40,257 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:43:40,257 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-2.i [2023-02-14 01:43:40,264 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5ec2c7b/2866b23af4724eacb97668f065348b78/FLAG3caef3c88 [2023-02-14 01:43:40,273 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5ec2c7b/2866b23af4724eacb97668f065348b78 [2023-02-14 01:43:40,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:43:40,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:43:40,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:43:40,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:43:40,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:43:40,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:43:40" (1/1) ... [2023-02-14 01:43:40,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349836c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:40, skipping insertion in model container [2023-02-14 01:43:40,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:43:40" (1/1) ... [2023-02-14 01:43:40,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:43:40,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:43:40,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:43:40,575 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-14 01:43:40,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7e05c542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:40, skipping insertion in model container [2023-02-14 01:43:40,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:43:40,578 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-14 01:43:40,580 INFO L158 Benchmark]: Toolchain (without parser) took 303.42ms. Allocated memory is still 130.0MB. Free memory was 81.3MB in the beginning and 69.6MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 01:43:40,584 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory was 44.3MB in the beginning and 44.2MB in the end (delta: 131.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 01:43:40,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.80ms. Allocated memory is still 130.0MB. Free memory was 81.3MB in the beginning and 69.6MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 01:43:40,586 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 100.7MB. Free memory was 44.3MB in the beginning and 44.2MB in the end (delta: 131.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.80ms. Allocated memory is still 130.0MB. Free memory was 81.3MB in the beginning and 69.6MB in the end (delta: 11.7MB). 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-?-2329fc7 [2023-02-14 01:43:42,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:43:42,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:43:42,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:43:42,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:43:42,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:43:42,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:43:42,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:43:42,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:43:42,145 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:43:42,146 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:43:42,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:43:42,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:43:42,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:43:42,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:43:42,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:43:42,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:43:42,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:43:42,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:43:42,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:43:42,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:43:42,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:43:42,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:43:42,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:43:42,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:43:42,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:43:42,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:43:42,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:43:42,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:43:42,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:43:42,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:43:42,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:43:42,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:43:42,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:43:42,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:43:42,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:43:42,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:43:42,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:43:42,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:43:42,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:43:42,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:43:42,185 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-14 01:43:42,211 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:43:42,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:43:42,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:43:42,212 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:43:42,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:43:42,213 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:43:42,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:43:42,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:43:42,214 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:43:42,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:43:42,215 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:43:42,215 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:43:42,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:43:42,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:43:42,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:43:42,215 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:43:42,215 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:43:42,216 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:43:42,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:43:42,216 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:43:42,216 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-14 01:43:42,216 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-14 01:43:42,216 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:43:42,225 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:43:42,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:43:42,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:43:42,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:43:42,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:43:42,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:43:42,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:43:42,226 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-14 01:43:42,226 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-14 01:43:42,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:43:42,227 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:43:42,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:43:42,227 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-14 01:43:42,227 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:43:42,227 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-14 01:43:42,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:43:42,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:43:42,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:43:42,519 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:43:42,520 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:43:42,521 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-14 01:43:43,511 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:43:43,709 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:43:43,709 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-2.i [2023-02-14 01:43:43,732 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2d0f5318/af8a9a93f5644a1b8430ad8388a05b7f/FLAGf61ecce32 [2023-02-14 01:43:43,742 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2d0f5318/af8a9a93f5644a1b8430ad8388a05b7f [2023-02-14 01:43:43,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:43:43,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:43:43,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:43:43,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:43:43,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:43:43,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:43:43" (1/1) ... [2023-02-14 01:43:43,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf7f8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:43, skipping insertion in model container [2023-02-14 01:43:43,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:43:43" (1/1) ... [2023-02-14 01:43:43,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:43:43,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:43:44,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:43:44,041 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-14 01:43:44,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:43:44,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:43:44,090 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 01:43:44,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:43:44,152 INFO L208 MainTranslator]: Completed translation [2023-02-14 01:43:44,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44 WrapperNode [2023-02-14 01:43:44,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:43:44,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 01:43:44,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 01:43:44,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 01:43:44,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44" (1/1) ... [2023-02-14 01:43:44,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44" (1/1) ... [2023-02-14 01:43:44,207 INFO L138 Inliner]: procedures = 136, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2023-02-14 01:43:44,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 01:43:44,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 01:43:44,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 01:43:44,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 01:43:44,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44" (1/1) ... [2023-02-14 01:43:44,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44" (1/1) ... [2023-02-14 01:43:44,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44" (1/1) ... [2023-02-14 01:43:44,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44" (1/1) ... [2023-02-14 01:43:44,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44" (1/1) ... [2023-02-14 01:43:44,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44" (1/1) ... [2023-02-14 01:43:44,285 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44" (1/1) ... [2023-02-14 01:43:44,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44" (1/1) ... [2023-02-14 01:43:44,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 01:43:44,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 01:43:44,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 01:43:44,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 01:43:44,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44" (1/1) ... [2023-02-14 01:43:44,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:43:44,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:44,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 01:43:44,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 01:43:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2023-02-14 01:43:44,352 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2023-02-14 01:43:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 01:43:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 01:43:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure create_sub_list [2023-02-14 01:43:44,352 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sub_list [2023-02-14 01:43:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 01:43:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 01:43:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 01:43:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-14 01:43:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 01:43:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 01:43:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-14 01:43:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 01:43:44,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 01:43:44,496 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 01:43:44,498 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 01:43:44,771 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 01:43:44,775 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 01:43:44,788 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-14 01:43:44,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:43:44 BoogieIcfgContainer [2023-02-14 01:43:44,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 01:43:44,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 01:43:44,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 01:43:44,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 01:43:44,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:43:43" (1/3) ... [2023-02-14 01:43:44,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15735141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:43:44, skipping insertion in model container [2023-02-14 01:43:44,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:44" (2/3) ... [2023-02-14 01:43:44,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15735141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:43:44, skipping insertion in model container [2023-02-14 01:43:44,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:43:44" (3/3) ... [2023-02-14 01:43:44,797 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0102-2.i [2023-02-14 01:43:44,813 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 01:43:44,818 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-02-14 01:43:44,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 01:43:44,878 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;@4788bc14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 01:43:44,879 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-02-14 01:43:44,882 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-14 01:43:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 01:43:44,887 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:44,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 01:43:44,888 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-14 01:43:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:44,895 INFO L85 PathProgramCache]: Analyzing trace with hash 60205689, now seen corresponding path program 1 times [2023-02-14 01:43:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:44,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127155302] [2023-02-14 01:43:44,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:44,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:44,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:44,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:44,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-14 01:43:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:44,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-14 01:43:44,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:45,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:45,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:45,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127155302] [2023-02-14 01:43:45,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127155302] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:45,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:45,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:43:45,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694397674] [2023-02-14 01:43:45,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:45,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 01:43:45,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:45,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 01:43:45,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 01:43:45,037 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-14 01:43:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:45,052 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-02-14 01:43:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 01:43:45,054 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-14 01:43:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:45,058 INFO L225 Difference]: With dead ends: 83 [2023-02-14 01:43:45,058 INFO L226 Difference]: Without dead ends: 81 [2023-02-14 01:43:45,059 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-14 01:43:45,062 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-14 01:43:45,062 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-14 01:43:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-14 01:43:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-14 01:43:45,086 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-14 01:43:45,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-14 01:43:45,091 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 5 [2023-02-14 01:43:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:45,091 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-14 01:43:45,092 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-14 01:43:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-14 01:43:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 01:43:45,092 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:45,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:45,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:45,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:45,300 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-14 01:43:45,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:45,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2005144647, now seen corresponding path program 1 times [2023-02-14 01:43:45,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:45,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062278032] [2023-02-14 01:43:45,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:45,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:45,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:45,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:45,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-14 01:43:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:45,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:43:45,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:45,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:43:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:45,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:45,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:45,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062278032] [2023-02-14 01:43:45,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062278032] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:45,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:45,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:43:45,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41674285] [2023-02-14 01:43:45,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:45,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:43:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:45,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:43:45,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:43:45,504 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-14 01:43:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:45,708 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-02-14 01:43:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:43:45,708 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-14 01:43:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:45,709 INFO L225 Difference]: With dead ends: 108 [2023-02-14 01:43:45,709 INFO L226 Difference]: Without dead ends: 108 [2023-02-14 01:43:45,710 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-14 01:43:45,710 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 60 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 01:43:45,711 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-14 01:43:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-14 01:43:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 79. [2023-02-14 01:43:45,715 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-14 01:43:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-02-14 01:43:45,727 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 7 [2023-02-14 01:43:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:45,727 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-02-14 01:43:45,728 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-14 01:43:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-02-14 01:43:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 01:43:45,728 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:45,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:45,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-02-14 01:43:45,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:45,929 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-14 01:43:45,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2005144648, now seen corresponding path program 1 times [2023-02-14 01:43:45,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:45,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24401778] [2023-02-14 01:43:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:45,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:45,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:45,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:45,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-14 01:43:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:46,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:43:46,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:46,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 5 [2023-02-14 01:43:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:46,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:46,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:46,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24401778] [2023-02-14 01:43:46,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24401778] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:46,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:46,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:43:46,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790808153] [2023-02-14 01:43:46,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:46,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:43:46,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:46,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:43:46,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:43:46,130 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-14 01:43:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:46,324 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-02-14 01:43:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:43:46,325 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-14 01:43:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:46,327 INFO L225 Difference]: With dead ends: 83 [2023-02-14 01:43:46,327 INFO L226 Difference]: Without dead ends: 83 [2023-02-14 01:43:46,328 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-14 01:43:46,328 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-14 01:43:46,328 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-14 01:43:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-14 01:43:46,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2023-02-14 01:43:46,338 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-14 01:43:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-02-14 01:43:46,343 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 7 [2023-02-14 01:43:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:46,344 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-02-14 01:43:46,344 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-14 01:43:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-02-14 01:43:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 01:43:46,345 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:46,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:46,352 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-14 01:43:46,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:46,552 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-14 01:43:46,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:46,553 INFO L85 PathProgramCache]: Analyzing trace with hash 859208239, now seen corresponding path program 1 times [2023-02-14 01:43:46,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:46,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445511704] [2023-02-14 01:43:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:46,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:46,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:46,558 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:46,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-14 01:43:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:46,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 01:43:46,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:46,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:43:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:46,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:46,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:46,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445511704] [2023-02-14 01:43:46,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445511704] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:46,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:46,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:43:46,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839622203] [2023-02-14 01:43:46,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:46,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:43:46,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:46,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:43:46,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:43:46,660 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-14 01:43:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:46,767 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2023-02-14 01:43:46,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:43:46,767 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-14 01:43:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:46,768 INFO L225 Difference]: With dead ends: 82 [2023-02-14 01:43:46,769 INFO L226 Difference]: Without dead ends: 82 [2023-02-14 01:43:46,769 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-14 01:43:46,769 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-14 01:43:46,770 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-14 01:43:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-14 01:43:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2023-02-14 01:43:46,776 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-14 01:43:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-14 01:43:46,777 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 11 [2023-02-14 01:43:46,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:46,777 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-14 01:43:46,777 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-14 01:43:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-14 01:43:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 01:43:46,778 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:46,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:46,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:46,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:46,978 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-14 01:43:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:46,979 INFO L85 PathProgramCache]: Analyzing trace with hash 859208240, now seen corresponding path program 1 times [2023-02-14 01:43:46,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:46,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500630143] [2023-02-14 01:43:46,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:46,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:46,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:46,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:46,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-14 01:43:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:47,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:43:47,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:47,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:43:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:47,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:47,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:47,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500630143] [2023-02-14 01:43:47,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500630143] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:47,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:47,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:43:47,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837292819] [2023-02-14 01:43:47,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:47,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:43:47,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:47,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:43:47,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:43:47,080 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-14 01:43:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:47,161 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-02-14 01:43:47,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:43:47,162 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-14 01:43:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:47,163 INFO L225 Difference]: With dead ends: 81 [2023-02-14 01:43:47,163 INFO L226 Difference]: Without dead ends: 81 [2023-02-14 01:43:47,163 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-14 01:43:47,163 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-14 01:43:47,164 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-14 01:43:47,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-14 01:43:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2023-02-14 01:43:47,185 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-14 01:43:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2023-02-14 01:43:47,186 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 11 [2023-02-14 01:43:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:47,186 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2023-02-14 01:43:47,186 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-14 01:43:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2023-02-14 01:43:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 01:43:47,188 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:47,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:47,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-14 01:43:47,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:47,396 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-14 01:43:47,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1332328513, now seen corresponding path program 1 times [2023-02-14 01:43:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:47,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007478074] [2023-02-14 01:43:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:47,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-14 01:43:47,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:47,399 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:47,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-14 01:43:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:47,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 01:43:47,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:47,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:43:47,534 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:43:47,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 01:43:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:47,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:47,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:47,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007478074] [2023-02-14 01:43:47,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007478074] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:47,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:47,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 01:43:47,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151036774] [2023-02-14 01:43:47,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:47,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:43:47,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:47,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:43:47,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:43:47,569 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-14 01:43:47,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:47,841 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2023-02-14 01:43:47,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:43:47,842 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-14 01:43:47,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:47,843 INFO L225 Difference]: With dead ends: 129 [2023-02-14 01:43:47,843 INFO L226 Difference]: Without dead ends: 129 [2023-02-14 01:43:47,843 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-14 01:43:47,843 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.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:47,844 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.2s Time] [2023-02-14 01:43:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-14 01:43:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 90. [2023-02-14 01:43:47,848 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-14 01:43:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2023-02-14 01:43:47,848 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 14 [2023-02-14 01:43:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:47,849 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2023-02-14 01:43:47,849 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-14 01:43:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2023-02-14 01:43:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 01:43:47,849 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:47,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:47,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:48,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:48,058 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-14 01:43:48,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:48,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1332328512, now seen corresponding path program 1 times [2023-02-14 01:43:48,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:48,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232330355] [2023-02-14 01:43:48,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:48,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:48,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:48,060 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:48,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-14 01:43:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:48,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-14 01:43:48,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:48,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:43:48,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:43:48,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:43:48,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:43:48,233 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:43:48,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:43:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:48,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:48,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:48,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232330355] [2023-02-14 01:43:48,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232330355] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:48,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:48,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 01:43:48,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388838912] [2023-02-14 01:43:48,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:48,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:43:48,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:48,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:43:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:43:48,280 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-14 01:43:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:48,644 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2023-02-14 01:43:48,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:43:48,644 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-14 01:43:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:48,645 INFO L225 Difference]: With dead ends: 117 [2023-02-14 01:43:48,645 INFO L226 Difference]: Without dead ends: 117 [2023-02-14 01:43:48,645 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-14 01:43:48,645 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-14 01:43:48,646 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-14 01:43:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-14 01:43:48,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2023-02-14 01:43:48,650 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-14 01:43:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2023-02-14 01:43:48,650 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 14 [2023-02-14 01:43:48,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:48,651 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2023-02-14 01:43:48,651 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-14 01:43:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2023-02-14 01:43:48,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:43:48,651 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:48,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:48,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:48,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:48,859 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-14 01:43:48,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash -467443808, now seen corresponding path program 1 times [2023-02-14 01:43:48,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:48,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213183264] [2023-02-14 01:43:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:48,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-14 01:43:48,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:48,862 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:48,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-14 01:43:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:48,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:43:48,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:48,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:48,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:48,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213183264] [2023-02-14 01:43:48,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213183264] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:48,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:48,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:43:48,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081423941] [2023-02-14 01:43:48,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:48,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:43:48,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:43:48,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:43:48,999 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-14 01:43:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:49,139 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2023-02-14 01:43:49,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:43:49,139 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-14 01:43:49,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:49,140 INFO L225 Difference]: With dead ends: 107 [2023-02-14 01:43:49,140 INFO L226 Difference]: Without dead ends: 107 [2023-02-14 01:43:49,140 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-14 01:43:49,140 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-14 01:43:49,141 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-14 01:43:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-14 01:43:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-14 01:43:49,143 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-14 01:43:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2023-02-14 01:43:49,144 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 16 [2023-02-14 01:43:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:49,144 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2023-02-14 01:43:49,144 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-14 01:43:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2023-02-14 01:43:49,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:43:49,144 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:49,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:49,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:49,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:49,352 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-14 01:43:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash -467443807, now seen corresponding path program 1 times [2023-02-14 01:43:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:49,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478622002] [2023-02-14 01:43:49,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:49,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:49,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:49,355 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:49,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-14 01:43:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:49,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 01:43:49,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:49,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:49,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:49,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478622002] [2023-02-14 01:43:49,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478622002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:49,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:49,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-14 01:43:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311363266] [2023-02-14 01:43:49,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:49,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:43:49,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:49,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:43:49,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:43:49,531 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-14 01:43:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:49,767 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2023-02-14 01:43:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:43:49,767 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-14 01:43:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:49,768 INFO L225 Difference]: With dead ends: 115 [2023-02-14 01:43:49,768 INFO L226 Difference]: Without dead ends: 115 [2023-02-14 01:43:49,768 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-14 01:43:49,768 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-14 01:43:49,769 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-14 01:43:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-14 01:43:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2023-02-14 01:43:49,771 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-14 01:43:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2023-02-14 01:43:49,772 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 16 [2023-02-14 01:43:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:49,773 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2023-02-14 01:43:49,773 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-14 01:43:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2023-02-14 01:43:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 01:43:49,773 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:49,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:49,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:49,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:49,982 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-14 01:43:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1605856063, now seen corresponding path program 1 times [2023-02-14 01:43:49,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:49,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369235967] [2023-02-14 01:43:49,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:49,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:49,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:49,984 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:49,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-14 01:43:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:50,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:43:50,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:50,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:43:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:50,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:50,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:50,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369235967] [2023-02-14 01:43:50,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369235967] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:50,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:50,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:43:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436702816] [2023-02-14 01:43:50,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:50,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:43:50,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:50,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:43:50,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:43:50,129 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-14 01:43:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:50,304 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2023-02-14 01:43:50,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:43:50,304 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-14 01:43:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:50,305 INFO L225 Difference]: With dead ends: 114 [2023-02-14 01:43:50,305 INFO L226 Difference]: Without dead ends: 114 [2023-02-14 01:43:50,305 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-14 01:43:50,305 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-14 01:43:50,306 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-14 01:43:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-14 01:43:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2023-02-14 01:43:50,308 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-14 01:43:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2023-02-14 01:43:50,309 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 17 [2023-02-14 01:43:50,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:50,309 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2023-02-14 01:43:50,309 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-14 01:43:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2023-02-14 01:43:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 01:43:50,309 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:50,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:50,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:50,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:50,510 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-14 01:43:50,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1605856062, now seen corresponding path program 1 times [2023-02-14 01:43:50,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:50,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048848031] [2023-02-14 01:43:50,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:50,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:50,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:50,512 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:50,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-14 01:43:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:50,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 01:43:50,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:50,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:43:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:50,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:50,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:50,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048848031] [2023-02-14 01:43:50,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048848031] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:50,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:50,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:43:50,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424417822] [2023-02-14 01:43:50,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:50,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:43:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:50,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:43:50,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:43:50,652 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-14 01:43:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:50,862 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2023-02-14 01:43:50,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:43:50,863 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-14 01:43:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:50,864 INFO L225 Difference]: With dead ends: 112 [2023-02-14 01:43:50,864 INFO L226 Difference]: Without dead ends: 112 [2023-02-14 01:43:50,864 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-14 01:43:50,864 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-14 01:43:50,864 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-14 01:43:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-14 01:43:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2023-02-14 01:43:50,866 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-14 01:43:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2023-02-14 01:43:50,867 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 17 [2023-02-14 01:43:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:50,867 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2023-02-14 01:43:50,867 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-14 01:43:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2023-02-14 01:43:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 01:43:50,868 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:50,868 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-14 01:43:50,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:51,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:51,079 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-14 01:43:51,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1334414076, now seen corresponding path program 1 times [2023-02-14 01:43:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:51,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912130209] [2023-02-14 01:43:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:51,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:51,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:51,085 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:51,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-14 01:43:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:51,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-14 01:43:51,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:51,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:43:51,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:43:51,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:43:51,298 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:43:51,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:43:51,326 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-14 01:43:51,377 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-14 01:43:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:51,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:51,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:51,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912130209] [2023-02-14 01:43:51,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912130209] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:51,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:51,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 01:43:51,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124327713] [2023-02-14 01:43:51,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:51,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:43:51,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:51,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:43:51,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-14 01:43:51,408 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-14 01:43:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:51,969 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2023-02-14 01:43:51,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 01:43:51,970 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-14 01:43:51,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:51,972 INFO L225 Difference]: With dead ends: 162 [2023-02-14 01:43:51,972 INFO L226 Difference]: Without dead ends: 162 [2023-02-14 01:43:51,972 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-14 01:43:51,972 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.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:51,973 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.4s Time] [2023-02-14 01:43:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-14 01:43:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 128. [2023-02-14 01:43:51,975 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-14 01:43:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2023-02-14 01:43:51,976 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 19 [2023-02-14 01:43:51,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:51,976 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2023-02-14 01:43:51,976 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-14 01:43:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2023-02-14 01:43:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 01:43:51,978 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:51,978 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-14 01:43:51,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:52,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:52,186 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-14 01:43:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1334414075, now seen corresponding path program 1 times [2023-02-14 01:43:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:52,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639383297] [2023-02-14 01:43:52,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:52,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-14 01:43:52,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:52,189 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:52,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 (14)] Waiting until timeout for monitored process [2023-02-14 01:43:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:52,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 01:43:52,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:52,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 7 [2023-02-14 01:43:52,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:43:52,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:43:52,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:43:52,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:43:52,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:43:52,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:43:52,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:43:52,609 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:43:52,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:43:52,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:43:52,665 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-14 01:43:52,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 14 treesize of output 16 [2023-02-14 01:43:52,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:43:52,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:43:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:52,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:52,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:52,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639383297] [2023-02-14 01:43:52,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639383297] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:52,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:52,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 01:43:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070583223] [2023-02-14 01:43:52,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:52,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:43:52,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:52,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:43:52,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-14 01:43:52,806 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-14 01:43:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:53,501 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2023-02-14 01:43:53,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 01:43:53,502 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-14 01:43:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:53,503 INFO L225 Difference]: With dead ends: 131 [2023-02-14 01:43:53,503 INFO L226 Difference]: Without dead ends: 131 [2023-02-14 01:43:53,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2023-02-14 01:43:53,504 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-14 01:43:53,504 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-14 01:43:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-14 01:43:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-02-14 01:43:53,506 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-14 01:43:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2023-02-14 01:43:53,507 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 19 [2023-02-14 01:43:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:53,507 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2023-02-14 01:43:53,507 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-14 01:43:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2023-02-14 01:43:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-14 01:43:53,508 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:53,508 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-14 01:43:53,527 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 (14)] Ended with exit code 0 [2023-02-14 01:43:53,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:53,709 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-14 01:43:53,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:53,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1965497160, now seen corresponding path program 1 times [2023-02-14 01:43:53,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:43:53,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593274432] [2023-02-14 01:43:53,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:53,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:43:53,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:43:53,710 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:43:53,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-14 01:43:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:53,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 01:43:53,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:53,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:43:53,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:43:53,907 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-14 01:43:53,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:43:53,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:43:53,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:43:53,952 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:43:53,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:43:53,995 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-14 01:43:53,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:56,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:43:56,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593274432] [2023-02-14 01:43:56,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593274432] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:56,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2076980799] [2023-02-14 01:43:56,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:56,399 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:43:56,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:43:56,400 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-14 01:43:56,405 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-14 01:43:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:56,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-14 01:43:56,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:56,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:43:56,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:43:56,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:43:57,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:43:57,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:43:57,159 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:43:57,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:43:57,174 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-14 01:43:57,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:57,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2076980799] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:57,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:43:57,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 13 [2023-02-14 01:43:57,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599705923] [2023-02-14 01:43:57,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:57,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 01:43:57,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:43:57,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 01:43:57,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=4, NotChecked=32, Total=342 [2023-02-14 01:43:57,665 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-14 01:44:00,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:44:04,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:44:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:44:06,722 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2023-02-14 01:44:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 01:44:06,723 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-14 01:44:06,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:44:06,724 INFO L225 Difference]: With dead ends: 146 [2023-02-14 01:44:06,724 INFO L226 Difference]: Without dead ends: 146 [2023-02-14 01:44:06,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=80, Invalid=470, Unknown=6, NotChecked=44, Total=600 [2023-02-14 01:44:06,725 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 65 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s 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.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:44:06,725 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.7s Time] [2023-02-14 01:44:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-14 01:44:06,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2023-02-14 01:44:06,728 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-14 01:44:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2023-02-14 01:44:06,728 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 29 [2023-02-14 01:44:06,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:44:06,728 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2023-02-14 01:44:06,728 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-14 01:44:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2023-02-14 01:44:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 01:44:06,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:44:06,729 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-14 01:44:06,734 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-14 01:44:06,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-14 01:44:07,133 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-14 01:44:07,134 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-14 01:44:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:44:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1572542800, now seen corresponding path program 1 times [2023-02-14 01:44:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:44:07,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444268355] [2023-02-14 01:44:07,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:44:07,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:44:07,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:44:07,136 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:44:07,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-14 01:44:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:44:07,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-14 01:44:07,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:44:07,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:07,742 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 16 [2023-02-14 01:44:07,749 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:44:07,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:44:07,868 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-14 01:44:07,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:44:11,052 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 60 treesize of output 54 [2023-02-14 01:44:11,096 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-02-14 01:44:11,097 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 50 treesize of output 67 [2023-02-14 01:44:11,736 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 01:44:11,737 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 38 treesize of output 32 [2023-02-14 01:44:11,749 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-14 01:44:11,749 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-14 01:44:12,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:44:12,078 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 38 treesize of output 40 [2023-02-14 01:44:12,153 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-14 01:44:12,153 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-14 01:44:12,323 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-14 01:44:12,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:44:12,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444268355] [2023-02-14 01:44:12,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444268355] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:44:12,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:44:12,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2023-02-14 01:44:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001988532] [2023-02-14 01:44:12,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:44:12,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-14 01:44:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:44:12,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-14 01:44:12,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2023-02-14 01:44:12,324 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 25 states have internal predecessors, (58), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:44:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:44:16,619 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2023-02-14 01:44:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 01:44:16,619 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 25 states have internal predecessors, (58), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2023-02-14 01:44:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:44:16,620 INFO L225 Difference]: With dead ends: 168 [2023-02-14 01:44:16,620 INFO L226 Difference]: Without dead ends: 168 [2023-02-14 01:44:16,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=231, Invalid=1575, Unknown=0, NotChecked=0, Total=1806 [2023-02-14 01:44:16,621 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 296 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:44:16,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 597 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-02-14 01:44:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-14 01:44:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 136. [2023-02-14 01:44:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 98 states have (on average 1.336734693877551) internal successors, (131), 120 states have internal predecessors, (131), 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-14 01:44:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2023-02-14 01:44:16,625 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 36 [2023-02-14 01:44:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:44:16,625 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2023-02-14 01:44:16,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 25 states have internal predecessors, (58), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:44:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2023-02-14 01:44:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-14 01:44:16,626 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:44:16,626 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-14 01:44:16,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-14 01:44:16,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:44:16,838 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-14 01:44:16,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:44:16,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1746009876, now seen corresponding path program 1 times [2023-02-14 01:44:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:44:16,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123216008] [2023-02-14 01:44:16,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:44:16,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:44:16,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:44:16,857 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:44:16,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-14 01:44:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:44:17,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-14 01:44:17,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:44:17,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:44:17,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:44:17,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:44:17,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:17,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:44:17,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:17,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:44:17,388 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:44:17,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:44:17,473 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-14 01:44:17,492 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-14 01:44:17,505 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-14 01:44:17,510 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-14 01:44:18,282 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-14 01:44:18,320 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-14 01:44:18,321 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-14 01:44:18,326 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 132 treesize of output 96 [2023-02-14 01:44:18,335 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-14 01:44:18,348 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-14 01:44:18,497 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-14 01:44:18,497 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-14 01:44:18,608 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-14 01:44:18,884 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-14 01:44:19,134 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-14 01:44:19,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:44:23,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:44:23,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123216008] [2023-02-14 01:44:23,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123216008] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:44:23,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [170481711] [2023-02-14 01:44:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:44:23,011 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:44:23,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:44:23,012 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:44:23,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-02-14 01:44:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:44:23,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-14 01:44:23,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:44:23,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:44:23,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:44:23,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:44:23,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:23,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:44:23,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:23,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:44:23,664 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:44:23,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:44:23,718 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-14 01:44:23,734 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-14 01:44:23,744 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-14 01:44:23,748 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-14 01:44:24,347 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-14 01:44:24,384 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-14 01:44:24,384 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-14 01:44:24,390 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-14 01:44:24,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:24,396 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-14 01:44:24,404 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-14 01:44:24,509 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-14 01:44:24,510 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-14 01:44:24,634 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-14 01:44:24,891 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-14 01:44:25,086 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-14 01:44:25,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:44:25,111 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_835 (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_835) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (_ bv1 1)))) is different from false [2023-02-14 01:44:26,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [170481711] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:44:26,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:44:26,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 27 [2023-02-14 01:44:26,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745167079] [2023-02-14 01:44:26,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:44:26,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-14 01:44:26,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:44:26,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-14 01:44:26,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1245, Unknown=50, NotChecked=72, Total=1482 [2023-02-14 01:44:26,193 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 28 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:44:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:44:32,658 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2023-02-14 01:44:32,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-14 01:44:32,658 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-02-14 01:44:32,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:44:32,659 INFO L225 Difference]: With dead ends: 156 [2023-02-14 01:44:32,659 INFO L226 Difference]: Without dead ends: 156 [2023-02-14 01:44:32,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=309, Invalid=2803, Unknown=84, NotChecked=110, Total=3306 [2023-02-14 01:44:32,660 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 74 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 23 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:44:32,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1048 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1183 Invalid, 15 Unknown, 0 Unchecked, 3.4s Time] [2023-02-14 01:44:32,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-14 01:44:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2023-02-14 01:44:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 110 states have (on average 1.309090909090909) internal successors, (144), 133 states have internal predecessors, (144), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-14 01:44:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2023-02-14 01:44:32,664 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 35 [2023-02-14 01:44:32,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:44:32,664 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2023-02-14 01:44:32,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:44:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2023-02-14 01:44:32,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-14 01:44:32,665 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:44:32,665 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-14 01:44:32,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2023-02-14 01:44:32,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-14 01:44:33,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:44:33,066 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-14 01:44:33,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:44:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1746009877, now seen corresponding path program 1 times [2023-02-14 01:44:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:44:33,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862264698] [2023-02-14 01:44:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:44:33,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:44:33,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:44:33,068 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:44:33,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-14 01:44:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:44:33,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-14 01:44:33,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:44:33,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:44:33,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:44:33,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:44:33,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:33,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:44:33,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:33,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:44:33,567 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:44:33,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:44:33,589 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-14 01:44:33,664 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-14 01:44:33,673 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-14 01:44:33,706 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-14 01:44:33,711 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-14 01:44:34,939 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-14 01:44:35,030 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-14 01:44:35,030 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-14 01:44:35,037 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-14 01:44:35,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:35,042 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-14 01:44:35,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:35,052 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-14 01:44:35,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:35,057 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-14 01:44:35,286 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-14 01:44:35,286 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-14 01:44:35,299 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-14 01:44:35,429 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-14 01:44:35,445 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 01:44:35,446 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 74 treesize of output 64 [2023-02-14 01:44:35,691 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-14 01:44:35,696 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 15 treesize of output 7 [2023-02-14 01:44:35,826 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-14 01:44:35,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:44:36,558 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_965 (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_965) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_965 (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_965) |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_964) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)))))) is different from false [2023-02-14 01:44:45,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:44:45,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862264698] [2023-02-14 01:44:45,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862264698] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:44:45,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [427919271] [2023-02-14 01:44:45,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:44:45,558 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:44:45,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:44:45,559 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:44:45,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-02-14 01:44:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:44:46,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 100 conjunts are in the unsatisfiable core [2023-02-14 01:44:46,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:44:46,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:44:46,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:44:46,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:44:46,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:46,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:44:46,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:46,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:44:46,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:44:46,512 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:44:46,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:44:46,578 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-14 01:44:46,598 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-14 01:44:46,611 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-14 01:44:46,616 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-14 01:44:49,759 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 133 treesize of output 86 [2023-02-14 01:44:49,767 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 71 [2023-02-14 01:44:49,823 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2023-02-14 01:44:49,823 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 124 treesize of output 150 [2023-02-14 01:44:49,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:49,831 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-14 01:44:49,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:49,842 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-14 01:44:49,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:44:49,847 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-14 01:44:50,346 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-14 01:44:50,346 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-14 01:44:50,360 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-14 01:44:50,591 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-14 01:44:50,606 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 01:44:50,607 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 74 treesize of output 64 [2023-02-14 01:44:50,636 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-14 01:44:50,643 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 15 treesize of output 7 [2023-02-14 01:44:50,849 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-14 01:44:50,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:44:50,953 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1105 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1104) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1105) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_1104 (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_1104) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2023-02-14 01:44:51,005 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|))) (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_30| (_ BitVec 32))) (or (forall ((v_ArrVal_1104 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_30| v_ArrVal_1104) |c_create_sub_list_~sub#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_30|))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_30| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_30|))) (forall ((v_ArrVal_1103 (_ BitVec 32)) (v_ArrVal_1104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1105 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_30| v_ArrVal_1104) |c_create_sub_list_~sub#1.base|) .cse1)) (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_30| v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$.base| |v_create_sub_list_insert_sub_~sub~0#1.base_30| v_ArrVal_1105) |c_create_sub_list_~sub#1.base|) .cse1)))))))) is different from false [2023-02-14 01:44:58,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [427919271] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:44:58,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:44:58,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2023-02-14 01:44:58,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185873518] [2023-02-14 01:44:58,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:44:58,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-14 01:44:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:44:58,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-14 01:44:58,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1351, Unknown=27, NotChecked=228, Total=1722 [2023-02-14 01:44:58,446 INFO L87 Difference]: Start difference. First operand 150 states and 163 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-14 01:45:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:45:09,999 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2023-02-14 01:45:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 01:45:09,999 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-14 01:45:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:45:10,000 INFO L225 Difference]: With dead ends: 150 [2023-02-14 01:45:10,000 INFO L226 Difference]: Without dead ends: 150 [2023-02-14 01:45:10,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=213, Invalid=2315, Unknown=34, NotChecked=300, Total=2862 [2023-02-14 01:45:10,001 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 53 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 14 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:45:10,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 913 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1188 Invalid, 19 Unknown, 0 Unchecked, 5.1s Time] [2023-02-14 01:45:10,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-14 01:45:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-02-14 01:45:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 110 states have (on average 1.3) internal successors, (143), 133 states have internal predecessors, (143), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-14 01:45:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2023-02-14 01:45:10,006 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 35 [2023-02-14 01:45:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:45:10,006 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2023-02-14 01:45:10,006 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-14 01:45:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2023-02-14 01:45:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 01:45:10,007 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:45:10,007 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-14 01:45:10,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-14 01:45:10,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-02-14 01:45:10,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 01:45:10,430 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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-14 01:45:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:45:10,431 INFO L85 PathProgramCache]: Analyzing trace with hash 879107445, now seen corresponding path program 1 times [2023-02-14 01:45:10,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:45:10,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292155362] [2023-02-14 01:45:10,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:45:10,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:45:10,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:45:10,432 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:45:10,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-14 01:45:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:45:10,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-14 01:45:10,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:45:10,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:45:10,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:45:10,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:10,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:45:10,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:10,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:45:10,948 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:45:10,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:45:10,995 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-14 01:45:11,016 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-14 01:45:11,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:45:11,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:45:11,197 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-14 01:45:11,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:45:11,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:45:11,357 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-14 01:45:11,730 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1240) |c_create_sub_list_insert_sub_~head#1.base|) .cse0) |c_create_sub_list_insert_sub_~head#1.base|)) (forall ((v_ArrVal_1241 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1241) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (forall ((v_ArrVal_1241 (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_1241) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2023-02-14 01:45:11,777 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|))) (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_33|))) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |v_create_sub_list_insert_sub_~sub~0#1.base_33| v_ArrVal_1240) |c_create_sub_list_~sub#1.base|) .cse0) |c_create_sub_list_~sub#1.base|)))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_33|))) (forall ((v_ArrVal_1241 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_33| v_ArrVal_1241) |c_create_sub_list_~sub#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_33| (_ BitVec 32))) (or (forall ((v_ArrVal_1241 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_33| v_ArrVal_1241) |c_create_sub_list_~sub#1.base|) .cse0)) (bvadd (_ bv8 32) |c_create_sub_list_~sub#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_33|))))))) is different from false [2023-02-14 01:45:12,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:45:12,181 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-14 01:45:12,183 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-14 01:45:12,189 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-14 01:45:12,233 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 01:45:12,233 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-14 01:45:12,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:45:12,249 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-14 01:45:12,255 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:45:12,257 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-14 01:45:12,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:45:12,860 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 38 treesize of output 62 [2023-02-14 01:45:13,072 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-14 01:45:13,072 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-14 01:45:13,091 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-14 01:45:13,091 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-14 01:45:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-14 01:45:13,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:45:13,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292155362] [2023-02-14 01:45:13,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292155362] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:45:13,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:45:13,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2023-02-14 01:45:13,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737198718] [2023-02-14 01:45:13,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:45:13,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-14 01:45:13,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:45:13,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-14 01:45:13,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=687, Unknown=2, NotChecked=106, Total=870 [2023-02-14 01:45:13,109 INFO L87 Difference]: Start difference. First operand 150 states and 162 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-14 01:45:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:45:21,794 INFO L93 Difference]: Finished difference Result 220 states and 238 transitions. [2023-02-14 01:45:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-14 01:45:21,794 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-14 01:45:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:45:21,795 INFO L225 Difference]: With dead ends: 220 [2023-02-14 01:45:21,795 INFO L226 Difference]: Without dead ends: 220 [2023-02-14 01:45:21,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=332, Invalid=2326, Unknown=2, NotChecked=202, Total=2862 [2023-02-14 01:45:21,796 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 273 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 44 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:45:21,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 762 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1118 Invalid, 7 Unknown, 302 Unchecked, 3.8s Time] [2023-02-14 01:45:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-14 01:45:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 173. [2023-02-14 01:45:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 129 states have (on average 1.2635658914728682) internal successors, (163), 154 states have internal predecessors, (163), 11 states have call successors, (11), 10 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-14 01:45:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 186 transitions. [2023-02-14 01:45:21,800 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 186 transitions. Word has length 41 [2023-02-14 01:45:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:45:21,800 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 186 transitions. [2023-02-14 01:45:21,800 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-14 01:45:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 186 transitions. [2023-02-14 01:45:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 01:45:21,803 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:45:21,804 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-14 01:45:21,814 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 (22)] Ended with exit code 0 [2023-02-14 01:45:22,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:45:22,008 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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-14 01:45:22,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:45:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1398479560, now seen corresponding path program 1 times [2023-02-14 01:45:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:45:22,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160751233] [2023-02-14 01:45:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:45:22,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:45:22,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:45:22,011 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:45:22,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-14 01:45:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:45:22,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 01:45:22,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:45:22,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:45:22,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:45:22,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:45:22,485 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:45:22,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:45:22,496 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_create_sub_list_insert_sub_~sub~0#1.base_38| (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32)) (v_ArrVal_1343 (_ BitVec 32)) (v_ArrVal_1342 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_create_sub_list_insert_sub_~sub~0#1.base_38|)) (= (store (store |c_old(#length)| |v_create_sub_list_insert_sub_~sub~0#1.base_38| v_ArrVal_1342) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1343) |c_#length|) (not (= |c_create_sub_list_#in~sub#1.base| |create_sub_list_insert_sub_~sub~0#1.base|)))) is different from true [2023-02-14 01:45:22,530 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:45:22,531 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-14 01:45:22,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 01:45:22,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:22,600 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:45:22,600 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-14 01:45:22,613 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:45:22,613 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-14 01:45:22,674 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-14 01:45:22,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:45:22,991 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-14 01:45:22,991 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-14 01:45:27,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:45:27,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160751233] [2023-02-14 01:45:27,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160751233] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:45:27,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [23623006] [2023-02-14 01:45:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:45:27,222 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:45:27,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:45:27,223 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:45:27,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-02-14 01:45:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:45:27,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-14 01:45:27,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:45:27,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:45:27,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:45:27,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 5 [2023-02-14 01:45:28,108 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:45:28,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:45:28,241 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:45:28,242 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-14 01:45:28,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 01:45:28,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:28,554 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:45:28,555 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-14 01:45:28,564 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:45:28,564 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-14 01:45:28,583 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-14 01:45:28,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:45:28,985 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-14 01:45:28,986 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-14 01:45:31,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [23623006] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:45:31,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:45:31,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 21 [2023-02-14 01:45:31,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953693178] [2023-02-14 01:45:31,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:45:31,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-14 01:45:31,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:45:31,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-14 01:45:31,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=581, Unknown=6, NotChecked=48, Total=702 [2023-02-14 01:45:31,487 INFO L87 Difference]: Start difference. First operand 173 states and 186 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-14 01:45:32,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:45:46,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:45:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:45:49,315 INFO L93 Difference]: Finished difference Result 287 states and 317 transitions. [2023-02-14 01:45:49,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 01:45:49,316 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-14 01:45:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:45:49,317 INFO L225 Difference]: With dead ends: 287 [2023-02-14 01:45:49,317 INFO L226 Difference]: Without dead ends: 287 [2023-02-14 01:45:49,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=142, Invalid=1114, Unknown=8, NotChecked=68, Total=1332 [2023-02-14 01:45:49,318 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 207 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-02-14 01:45:49,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 467 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 886 Invalid, 1 Unknown, 144 Unchecked, 4.9s Time] [2023-02-14 01:45:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-02-14 01:45:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 180. [2023-02-14 01:45:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 158 states have internal predecessors, (169), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (14), 10 states have call predecessors, (14), 12 states have call successors, (14) [2023-02-14 01:45:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2023-02-14 01:45:49,322 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 45 [2023-02-14 01:45:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:45:49,322 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2023-02-14 01:45:49,322 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-14 01:45:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2023-02-14 01:45:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 01:45:49,323 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:45:49,323 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-14 01:45:49,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2023-02-14 01:45:49,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-14 01:45:49,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:45:49,724 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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-14 01:45:49,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:45:49,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1768276039, now seen corresponding path program 1 times [2023-02-14 01:45:49,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:45:49,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462479203] [2023-02-14 01:45:49,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:45:49,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:45:49,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:45:49,749 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:45:49,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-14 01:45:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:45:50,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 01:45:50,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:45:50,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:45:50,107 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:45:50,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:45:50,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-14 01:45:50,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:45:50,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:50,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 01:45:50,323 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv1 1)))) is different from true [2023-02-14 01:45:50,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:45:50,383 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:45:50,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 01:45:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-14 01:45:50,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:45:50,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:45:50,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462479203] [2023-02-14 01:45:50,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462479203] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:45:50,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1660038468] [2023-02-14 01:45:50,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:45:50,614 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:45:50,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:45:50,615 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-14 01:45:50,617 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-14 01:45:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:45:51,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 01:45:51,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:45:51,757 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:45:51,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 01:45:51,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-14 01:45:51,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:51,827 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2023-02-14 01:45:51,827 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-14 01:45:51,895 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 01:45:51,896 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-14 01:45:51,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:45:52,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:52,059 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2023-02-14 01:45:52,059 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-14 01:45:52,094 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 01:45:52,094 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-14 01:45:52,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:45:52,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:52,232 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2023-02-14 01:45:52,232 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-14 01:45:52,468 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-14 01:45:52,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:45:52,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1660038468] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:45:52,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:45:52,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2023-02-14 01:45:52,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533539106] [2023-02-14 01:45:52,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:45:52,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-14 01:45:52,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:45:52,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-14 01:45:52,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=499, Unknown=12, NotChecked=46, Total=650 [2023-02-14 01:45:52,541 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand has 21 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:45:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:45:54,092 INFO L93 Difference]: Finished difference Result 286 states and 315 transitions. [2023-02-14 01:45:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 01:45:54,093 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2023-02-14 01:45:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:45:54,094 INFO L225 Difference]: With dead ends: 286 [2023-02-14 01:45:54,094 INFO L226 Difference]: Without dead ends: 286 [2023-02-14 01:45:54,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=798, Unknown=15, NotChecked=60, Total=1056 [2023-02-14 01:45:54,095 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 576 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 97 mSolverCounterUnsat, 154 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 154 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:45:54,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 388 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 585 Invalid, 154 Unknown, 136 Unchecked, 1.2s Time] [2023-02-14 01:45:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-02-14 01:45:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 201. [2023-02-14 01:45:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 150 states have (on average 1.2866666666666666) internal successors, (193), 174 states have internal predecessors, (193), 15 states have call successors, (15), 12 states have call predecessors, (15), 13 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2023-02-14 01:45:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 229 transitions. [2023-02-14 01:45:54,100 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 229 transitions. Word has length 51 [2023-02-14 01:45:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:45:54,100 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 229 transitions. [2023-02-14 01:45:54,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:45:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 229 transitions. [2023-02-14 01:45:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 01:45:54,103 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:45:54,103 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-14 01:45:54,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-02-14 01:45:54,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-14 01:45:54,520 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-14 01:45:54,520 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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-14 01:45:54,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:45:54,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1768276040, now seen corresponding path program 1 times [2023-02-14 01:45:54,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:45:54,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23690878] [2023-02-14 01:45:54,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:45:54,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:45:54,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:45:54,522 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:45:54,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-14 01:45:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:45:54,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 01:45:54,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:45:54,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:45:54,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:45:54,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:54,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:45:54,936 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:45:54,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:45:54,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 01:45:55,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:45:55,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:55,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:45:55,155 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv12 32)))) is different from true [2023-02-14 01:45:55,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:45:55,260 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:45:55,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-14 01:45:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-14 01:45:55,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:45:55,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:45:55,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23690878] [2023-02-14 01:45:55,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23690878] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:45:55,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [559518380] [2023-02-14 01:45:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:45:55,791 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:45:55,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:45:55,792 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-14 01:45:55,792 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-14 01:45:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:45:56,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-14 01:45:56,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:45:56,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:45:56,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-14 01:45:56,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:56,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:45:57,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 01:45:57,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:45:57,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:57,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:45:57,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 01:45:57,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:45:57,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:45:57,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:45:57,489 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-14 01:45:57,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:45:58,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [559518380] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:45:58,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:45:58,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2023-02-14 01:45:58,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552412592] [2023-02-14 01:45:58,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:45:58,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 01:45:58,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:45:58,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 01:45:58,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=473, Unknown=7, NotChecked=44, Total=600 [2023-02-14 01:45:58,617 INFO L87 Difference]: Start difference. First operand 201 states and 229 transitions. Second operand has 20 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:46:00,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:46:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:46:02,994 INFO L93 Difference]: Finished difference Result 250 states and 278 transitions. [2023-02-14 01:46:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 01:46:02,994 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2023-02-14 01:46:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:46:02,995 INFO L225 Difference]: With dead ends: 250 [2023-02-14 01:46:02,995 INFO L226 Difference]: Without dead ends: 250 [2023-02-14 01:46:02,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=168, Invalid=813, Unknown=15, NotChecked=60, Total=1056 [2023-02-14 01:46:02,996 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 501 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 72 mSolverCounterUnsat, 191 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 191 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:46:02,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 409 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 647 Invalid, 191 Unknown, 146 Unchecked, 3.8s Time] [2023-02-14 01:46:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-02-14 01:46:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 201. [2023-02-14 01:46:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 150 states have (on average 1.28) internal successors, (192), 174 states have internal predecessors, (192), 15 states have call successors, (15), 12 states have call predecessors, (15), 13 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2023-02-14 01:46:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 228 transitions. [2023-02-14 01:46:03,003 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 228 transitions. Word has length 51 [2023-02-14 01:46:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:46:03,004 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 228 transitions. [2023-02-14 01:46:03,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:46:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 228 transitions. [2023-02-14 01:46:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 01:46:03,006 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:46:03,006 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-14 01:46:03,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-14 01:46:03,222 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-14 01:46:03,422 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-14 01:46:03,422 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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-14 01:46:03,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:46:03,422 INFO L85 PathProgramCache]: Analyzing trace with hash 636971300, now seen corresponding path program 2 times [2023-02-14 01:46:03,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:46:03,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567563082] [2023-02-14 01:46:03,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:46:03,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:46:03,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:46:03,424 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:46:03,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-14 01:46:04,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:46:04,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:46:04,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 99 conjunts are in the unsatisfiable core [2023-02-14 01:46:04,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:46:04,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:46:04,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:46:04,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:46:04,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:46:04,191 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:46:04,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:46:04,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 16 treesize of output 18 [2023-02-14 01:46:04,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:46:04,463 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:46:04,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 16 treesize of output 22 [2023-02-14 01:46:04,476 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-14 01:46:04,543 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:46:04,543 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-14 01:46:05,416 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 01:46:05,417 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-14 01:46:05,533 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 9 treesize of output 3 [2023-02-14 01:46:05,605 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:46:05,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:46:05,703 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-14 01:46:05,712 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-14 01:46:06,509 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-14 01:46:06,537 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-02-14 01:46:06,537 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-14 01:46:06,703 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-14 01:46:06,703 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-14 01:46:06,717 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-14 01:46:06,821 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-14 01:46:07,146 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-14 01:46:07,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:46:07,310 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-14 01:46:07,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:46:09,935 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-14 01:46:11,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:46:11,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567563082] [2023-02-14 01:46:11,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567563082] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:46:11,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [443610748] [2023-02-14 01:46:11,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:46:11,293 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:46:11,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:46:11,294 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-14 01:46:11,295 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-14 01:46:11,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 01:46:11,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430515312] [2023-02-14 01:46:11,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:46:11,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:46:11,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:46:11,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 1 [2023-02-14 01:46:11,848 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:46:11,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-02-14 01:46:13,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:46:13,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:46:13,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 116 conjunts are in the unsatisfiable core [2023-02-14 01:46:13,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:46:13,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:46:13,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:46:13,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:46:13,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:46:13,416 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-14 01:46:13,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:46:13,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:46:13,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:46:13,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:46:13,564 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:46:13,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:46:13,696 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-14 01:46:13,702 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-14 01:46:15,094 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-14 01:46:15,137 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-14 01:46:15,138 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-14 01:46:15,142 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-14 01:46:15,147 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-14 01:46:15,154 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-14 01:46:15,189 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:46:15,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:46:15,220 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-14 01:46:15,238 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-14 01:46:16,720 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-14 01:46:16,746 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-02-14 01:46:16,746 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-14 01:46:16,826 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-14 01:46:16,827 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-14 01:46:17,003 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-14 01:46:17,320 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-14 01:46:17,484 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-14 01:46:17,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:46:17,898 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 (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_2379) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (_ bv1 1)))) is different from false [2023-02-14 01:46:18,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430515312] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:46:18,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:46:18,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 55 [2023-02-14 01:46:18,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637443093] [2023-02-14 01:46:18,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:46:18,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-14 01:46:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:46:18,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-14 01:46:18,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=4349, Unknown=117, NotChecked=134, Total=4830 [2023-02-14 01:46:18,817 INFO L87 Difference]: Start difference. First operand 201 states and 228 transitions. Second operand has 56 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 49 states have internal predecessors, (76), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 01:46:35,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:46:35,940 INFO L93 Difference]: Finished difference Result 202 states and 227 transitions. [2023-02-14 01:46:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-14 01:46:35,943 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 49 states have internal predecessors, (76), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2023-02-14 01:46:35,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:46:35,943 INFO L225 Difference]: With dead ends: 202 [2023-02-14 01:46:35,943 INFO L226 Difference]: Without dead ends: 202 [2023-02-14 01:46:35,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2825 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=687, Invalid=9222, Unknown=195, NotChecked=198, Total=10302 [2023-02-14 01:46:35,946 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 115 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 2525 mSolverCounterSat, 29 mSolverCounterUnsat, 61 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 2615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2525 IncrementalHoareTripleChecker+Invalid, 61 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:46:35,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1698 Invalid, 2615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2525 Invalid, 61 Unknown, 0 Unchecked, 8.1s Time] [2023-02-14 01:46:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-14 01:46:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2023-02-14 01:46:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 174 states have internal predecessors, (191), 15 states have call successors, (15), 12 states have call predecessors, (15), 13 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2023-02-14 01:46:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 227 transitions. [2023-02-14 01:46:35,953 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 227 transitions. Word has length 51 [2023-02-14 01:46:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:46:35,954 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 227 transitions. [2023-02-14 01:46:35,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 49 states have internal predecessors, (76), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 01:46:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 227 transitions. [2023-02-14 01:46:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 01:46:35,954 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:46:35,954 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-14 01:46:35,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-14 01:46:36,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-02-14 01:46:36,355 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,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:46:36,355 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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-14 01:46:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:46:36,356 INFO L85 PathProgramCache]: Analyzing trace with hash 636971301, now seen corresponding path program 2 times [2023-02-14 01:46:36,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:46:36,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784198844] [2023-02-14 01:46:36,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:46:36,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:46:36,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:46:36,357 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:46:36,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-14 01:46:36,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:46:36,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:46:37,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 122 conjunts are in the unsatisfiable core [2023-02-14 01:46:37,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:46:37,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:46:37,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:46:37,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:46:37,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:46:37,098 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:46:37,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:46:37,142 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-14 01:46:37,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:46:37,359 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:46:37,359 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-14 01:46:37,364 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-14 01:46:37,485 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:46:37,485 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-14 01:46:38,305 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 01:46:38,305 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-14 01:46:38,411 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 9 treesize of output 3 [2023-02-14 01:46:38,484 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:46:38,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:46:38,495 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-14 01:46:38,602 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-14 01:46:38,635 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-14 01:46:39,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:46:39,132 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:46:39,132 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-14 01:46:39,141 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-14 01:46:39,286 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:46:39,286 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-14 01:46:39,415 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 01:46:39,415 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-14 01:46:39,419 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-14 01:46:39,613 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-14 01:46:39,658 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-02-14 01:46:39,658 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 50 treesize of output 55 [2023-02-14 01:46:39,838 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-14 01:46:39,838 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-14 01:46:39,849 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-14 01:46:39,966 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-14 01:46:39,972 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-14 01:46:40,300 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 33 treesize of output 17 [2023-02-14 01:46:40,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:46:40,551 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-14 01:46:40,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:46:42,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:46:42,887 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-14 01:46:42,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:46:42,921 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 414 treesize of output 395 [2023-02-14 01:46:42,931 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 378 treesize of output 314 [2023-02-14 01:46:42,940 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 314 treesize of output 282 [2023-02-14 01:46:42,955 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 149 treesize of output 133 [2023-02-14 01:46:43,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:46:43,316 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-14 01:46:43,319 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:46:43,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:46:43,345 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 482 treesize of output 475 [2023-02-14 01:46:43,365 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 229 treesize of output 221 [2023-02-14 01:46:43,372 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 450 treesize of output 434 [2023-02-14 01:47:38,212 WARN L233 SmtUtils]: Spent 45.12s on a formula simplification. DAG size of input: 114 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:47:38,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:47:38,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784198844] [2023-02-14 01:47:38,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784198844] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:47:38,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [745758529] [2023-02-14 01:47:38,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:47:38,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:47:38,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:47:38,222 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:47:38,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-02-14 01:47:39,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:47:39,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:47:40,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 137 conjunts are in the unsatisfiable core [2023-02-14 01:47:40,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:47:40,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:47:40,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:47:40,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:47:40,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:47:40,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:47:40,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:47:40,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:47:40,492 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:47:40,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:47:40,872 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-14 01:47:40,907 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-14 01:47:44,090 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 78 treesize of output 43 [2023-02-14 01:47:44,184 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-14 01:47:44,184 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-14 01:47:44,194 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-14 01:47:44,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:47:44,207 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 109 treesize of output 77 [2023-02-14 01:47:44,223 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-14 01:47:44,353 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:47:44,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:47:44,383 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-14 01:47:44,544 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-14 01:47:44,568 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-14 01:47:44,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 01:47:45,101 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:47:45,102 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-14 01:47:45,126 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-14 01:47:45,360 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:47:45,361 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-14 01:47:45,675 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 01:47:45,675 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-14 01:47:45,711 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-14 01:47:46,095 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-14 01:47:46,176 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-02-14 01:47:46,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 55 [2023-02-14 01:47:46,336 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-14 01:47:46,337 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 18 [2023-02-14 01:47:46,415 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-14 01:47:46,415 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-14 01:47:46,863 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-14 01:47:46,896 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-14 01:47:47,737 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:47:47,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-14 01:47:47,749 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:47:47,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-02-14 01:47:48,789 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-14 01:47:48,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:47:53,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:47:53,161 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-14 01:47:53,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:47:53,230 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 468 treesize of output 467 [2023-02-14 01:47:53,245 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 450 treesize of output 434 [2023-02-14 01:47:53,257 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 434 treesize of output 426 [2023-02-14 01:47:53,277 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 214 treesize of output 210 [2023-02-14 01:47:59,159 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 29 treesize of output 21 [2023-02-14 01:47:59,604 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-14 01:47:59,766 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-14 01:47:59,803 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-14 01:47:59,877 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 29 treesize of output 21 [2023-02-14 01:48:00,086 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-14 01:48:00,276 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 29 treesize of output 21 [2023-02-14 01:48:00,406 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 29 treesize of output 21 [2023-02-14 01:48:00,437 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-14 01:48:00,463 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-14 01:48:00,491 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 29 treesize of output 21 [2023-02-14 01:48:00,520 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 43 treesize of output 31 [2023-02-14 01:48:00,569 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 29 treesize of output 21 [2023-02-14 01:48:00,681 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 29 treesize of output 21 [2023-02-14 01:48:00,841 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-14 01:48:01,009 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-14 01:48:01,047 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-14 01:48:01,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 29 treesize of output 21 [2023-02-14 01:48:01,180 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 29 treesize of output 21 [2023-02-14 01:48:01,321 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-14 01:48:01,701 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 29 treesize of output 21 [2023-02-14 01:48:01,729 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-14 01:48:01,757 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-14 01:48:01,787 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 29 treesize of output 21 [2023-02-14 01:48:01,818 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 43 treesize of output 31 [2023-02-14 01:48:01,867 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 29 treesize of output 21 [2023-02-14 01:48:02,065 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 29 treesize of output 21 [2023-02-14 01:48:02,537 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-14 01:48:02,703 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-14 01:48:02,747 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-14 01:48:02,834 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 29 treesize of output 21 [2023-02-14 01:48:03,045 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-14 01:48:03,237 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 29 treesize of output 21 [2023-02-14 01:48:03,360 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 29 treesize of output 21 [2023-02-14 01:48:03,388 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-14 01:48:03,410 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-14 01:48:03,433 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 29 treesize of output 21 [2023-02-14 01:48:03,459 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 43 treesize of output 31 [2023-02-14 01:48:03,502 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 29 treesize of output 21 [2023-02-14 01:48:03,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:48:03,627 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-14 01:48:03,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:48:03,684 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-14 01:48:03,697 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-14 01:48:03,708 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-14 01:48:03,750 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-14 01:48:06,304 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse102 (select |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base|)) (.cse103 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (let ((.cse49 (select .cse102 .cse103))) (let ((.cse17 (= .cse49 |c_create_sub_list_~sub#1.base|)) (.cse45 (bvadd (_ bv8 32) |c_create_sub_list_~sub#1.offset|)) (.cse48 (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base| (store .cse102 .cse103 |c_create_sub_list_insert_sub_~sub~0#1.base|))) (.cse50 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|))) (let ((.cse82 (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_305 (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse100 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (let ((.cse101 (select .cse100 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (not (bvule .cse45 (select .cse100 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_305 (_ bv4 32)) .cse101) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse101) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse101) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|)))))))) (.cse13 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse98 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse98 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (select .cse98 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse99) (forall ((v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse99))))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))))))) (.cse16 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse97 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse97 |c_create_sub_list_~sub#1.base|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))) (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) (select .cse97 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))))))) (.cse3 (= |c_create_sub_list_insert_sub_~sub~0#1.base| |c_create_sub_list_~sub#1.base|)) (.cse5 (not .cse17)) (.cse76 (forall ((v_arrayElimCell_305 (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse95 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (let ((.cse96 (select .cse95 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (not (bvule .cse45 (select .cse95 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_305 (_ bv4 32)) .cse96) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse96) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|)))))))) (.cse8 (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|))) (let ((.cse4 (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse93 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (let ((.cse94 (select .cse93 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (not (bvule .cse45 (select .cse93 |c_create_sub_list_~sub#1.base|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (bvule .cse8 .cse94) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse94) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|)))))))) (.cse0 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (or (not (bvule .cse45 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)) |c_create_sub_list_~sub#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|)))))) (.cse1 (= |c_create_sub_list_insert_sub_~head#1.base| |c_create_sub_list_~sub#1.base|)) (.cse6 (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse91 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (let ((.cse92 (select .cse91 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (not (bvule .cse45 (select .cse91 |c_create_sub_list_~sub#1.base|))) (bvule .cse8 .cse92) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse92) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse92) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|)))))))) (.cse2 (= |c_create_sub_list_insert_sub_~head#1.offset| |c_create_sub_list_~sub#1.offset|)) (.cse23 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse89 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse89 |c_create_sub_list_~sub#1.base|))) (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_305 (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (select .cse89 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (bvule (bvadd v_arrayElimCell_305 (_ bv4 32)) .cse90) (forall ((v_arrayElimCell_308 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse90)) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse90) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse90)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))))))) (.cse37 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse87 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse87 |c_create_sub_list_~sub#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))) (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_305 (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse88 (select .cse87 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (bvule (bvadd v_arrayElimCell_305 (_ bv4 32)) .cse88) (forall ((v_arrayElimCell_308 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse88)) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse88)))))))) (.cse28 (or .cse5 .cse76)) (.cse12 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse85 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse85 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_308 (_ BitVec 32)) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse86 (select .cse85 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse86) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse86) (forall ((v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse86))))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))))))) (.cse14 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse83 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse83 |c_create_sub_list_~sub#1.base|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))) (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_308 (_ BitVec 32)) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (select .cse83 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse84) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse84)))))))) (.cse15 (or (and .cse13 .cse16) .cse3)) (.cse39 (or .cse3 .cse82)) (.cse40 (or .cse5 .cse82)) (.cse41 (or (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse79 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse79 |c_create_sub_list_~sub#1.base|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))) (forall ((v_arrayElimCell_305 (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select .cse79 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (bvule (bvadd v_arrayElimCell_305 (_ bv4 32)) .cse80) (forall ((v_arrayElimCell_308 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse80)))))))) (or .cse3 (forall ((v_arrayElimCell_305 (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse81 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse81 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_305 (_ bv4 32)) (select .cse81 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|)))))))) .cse17)) (.cse42 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse78 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (forall ((v_arrayElimCell_305 (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (select .cse78 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (bvule (bvadd v_arrayElimCell_305 (_ bv4 32)) .cse77) (forall ((v_arrayElimCell_308 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse77)) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse77)))) (not (bvule .cse45 (select .cse78 |c_create_sub_list_~sub#1.base|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))))))) (.cse43 (or .cse3 .cse76)) (.cse35 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse74 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse74 |c_create_sub_list_~sub#1.base|))) (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (select .cse74 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (forall ((v_arrayElimCell_307 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse75)) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse75)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))))))) (.cse30 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse72 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse72 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_308 (_ BitVec 32)) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (select .cse72 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse73) (forall ((v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse73))))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))))))) (.cse31 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse71 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse71 |c_create_sub_list_~sub#1.base|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))) (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_308 (_ BitVec 32)) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) (select .cse71 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))))))) (.cse32 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse69 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse69 |c_create_sub_list_~sub#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))) (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_308 (_ BitVec 32)) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select .cse69 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (forall ((v_arrayElimCell_307 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse70)) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse70) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse70)))))))) (.cse33 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse67 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse67 |c_create_sub_list_~sub#1.base|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))) (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select .cse67 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (forall ((v_arrayElimCell_308 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse68)) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse68)))))))) (.cse34 (or .cse5 (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse66 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse66 |c_create_sub_list_~sub#1.base|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) (select .cse66 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|)))))))) (.cse10 (not (bvule .cse45 (_ bv12 32)))) (.cse11 (not (= (select |c_#valid| |c_create_sub_list_~sub#1.base|) (_ bv0 1)))) (.cse9 (store |c_#length| |c_create_sub_list_~sub#1.base| (_ bv12 32))) (.cse22 (not .cse3))) (and (or .cse0 .cse1) (or .cse2 .cse0) (or .cse3 .cse4) (or .cse5 .cse6) (or (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_327 (_ BitVec 32))) (let ((.cse7 (select .cse9 v_arrayElimCell_327))) (or (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse7) (bvule .cse8 .cse7)))) .cse10 .cse11) (or .cse5 .cse0) (or .cse5 (and .cse12 .cse13 (or .cse10 (forall ((v_arrayElimCell_328 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_328))) .cse11) .cse14 .cse15 .cse16)) (or .cse4 .cse5) (or .cse10 (and (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_331 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_331))) (or .cse17 (and (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_330 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_330))) (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_308 (_ BitVec 32)) (v_arrayElimCell_329 (_ BitVec 32))) (let ((.cse18 (select .cse9 v_arrayElimCell_329))) (or (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse18) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse18)))))) (or (forall ((v_arrayElimCell_334 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_307 (_ BitVec 32))) (let ((.cse19 (select .cse9 v_arrayElimCell_334))) (or (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse19) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse19)))) .cse3) (forall ((v_arrayElimCell_333 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_308 (_ BitVec 32)) (v_arrayElimCell_307 (_ BitVec 32))) (let ((.cse20 (select .cse9 v_arrayElimCell_333))) (or (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse20) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse20) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse20)))) (or .cse5 (forall ((v_arrayElimCell_332 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_307 (_ BitVec 32))) (let ((.cse21 (select .cse9 v_arrayElimCell_332))) (or (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse21) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse21)))))) .cse11) (or .cse0 .cse22) (or .cse0 (bvule (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|) .cse8)) (or .cse10 .cse11) (or (and (or (and .cse12 .cse13 (or .cse10 .cse11 (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_340 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_340)))) .cse14 .cse15 .cse16) .cse5) .cse23 (or (and (or .cse5 (forall ((v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_307 (_ BitVec 32))) (let ((.cse24 (select .cse9 v_arrayElimCell_345))) (or (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse24) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse24))))) (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_308 (_ BitVec 32)) (v_arrayElimCell_307 (_ BitVec 32))) (let ((.cse25 (select .cse9 v_arrayElimCell_346))) (or (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse25) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse25) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse25)))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_344))) (or (and (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_308 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (let ((.cse26 (select .cse9 v_arrayElimCell_342))) (or (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse26) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse26)))) (forall ((v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_343)))) .cse17) (or (forall ((v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_307 (_ BitVec 32))) (let ((.cse27 (select .cse9 v_arrayElimCell_347))) (or (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse27) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse27)))) .cse3)) .cse10 .cse11) .cse28 (or .cse10 .cse11 (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_305 (_ BitVec 32)) (v_arrayElimCell_341 (_ BitVec 32))) (let ((.cse29 (select .cse9 v_arrayElimCell_341))) (or (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse29) (bvule (bvadd v_arrayElimCell_305 (_ bv4 32)) .cse29))))) (or (and (or (and .cse30 .cse31 (or .cse10 (forall ((v_arrayElimCell_336 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_336))) .cse11)) .cse17) .cse32 .cse33 .cse34 (or .cse5 (and (or (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_338 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_338))) .cse10 .cse11) .cse35)) (or .cse10 .cse11 (forall ((v_arrayElimCell_337 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_337)))) (or .cse10 .cse11 (forall ((v_arrayElimCell_339 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_308 (_ BitVec 32))) (let ((.cse36 (select .cse9 v_arrayElimCell_339))) (or (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse36) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse36)))))) .cse22) (or (and .cse37 (or (forall ((v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_305 (_ BitVec 32))) (let ((.cse38 (select .cse9 v_arrayElimCell_335))) (or (bvule (bvadd v_arrayElimCell_305 (_ bv4 32)) .cse38) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse38)))) .cse10 .cse11)) .cse17) .cse39 .cse40 .cse41 .cse42 .cse43) .cse1) (or (and (or (forall ((v_arrayElimCell_322 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (let ((.cse44 (select .cse9 v_arrayElimCell_322))) (or (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse44) (bvule .cse8 .cse44)))) .cse10 .cse11) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse46 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse46 |c_create_sub_list_~sub#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))) (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (select .cse46 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (forall ((v_arrayElimCell_308 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse47)) (bvule .cse8 .cse47) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse47)))))))) .cse17) (or (and (or .cse3 (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse51 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse51 |c_create_sub_list_~sub#1.base|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (bvule .cse8 (select .cse51 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse52 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse52 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select .cse52 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (forall ((v_arrayElimCell_308 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse53)) (bvule .cse8 .cse53)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|))))))) .cse17) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse54 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse54 |c_create_sub_list_~sub#1.base|))) (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (select .cse54 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (forall ((v_arrayElimCell_308 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse55)) (bvule .cse8 .cse55) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse55) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse55)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|)))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ BitVec 32))) (let ((.cse56 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_73| (_ bv12 32)))) (or (not (bvule .cse45 (select .cse56 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2733 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_307 (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select .cse56 (select (select (store (store (store .cse48 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2754) .cse49 v_ArrVal_2752) |v_create_sub_list_insert_sub_~sub~0#1.base_73| v_ArrVal_2733) |c_create_sub_list_~sub#1.base|) .cse50)))) (or (forall ((v_arrayElimCell_308 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse57)) (bvule .cse8 .cse57) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse57)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_73| |c_create_sub_list_~sub#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_73|)))))) (or .cse3 .cse6) (or .cse2 (and .cse23 (or .cse10 .cse11 (and (or .cse5 (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_319 (_ BitVec 32)) (v_arrayElimCell_307 (_ BitVec 32))) (let ((.cse58 (select .cse9 v_arrayElimCell_319))) (or (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse58) (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse58))))) (or (and (forall ((v_arrayElimCell_317 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_317))) (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_316 (_ BitVec 32)) (v_arrayElimCell_308 (_ BitVec 32))) (let ((.cse59 (select .cse9 v_arrayElimCell_316))) (or (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse59) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse59))))) .cse17) (or .cse3 (forall ((v_arrayElimCell_321 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_307 (_ BitVec 32))) (let ((.cse60 (select .cse9 v_arrayElimCell_321))) (or (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse60) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse60))))) (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_308 (_ BitVec 32)) (v_arrayElimCell_307 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (let ((.cse61 (select .cse9 v_arrayElimCell_320))) (or (bvule (bvadd v_arrayElimCell_307 (_ bv4 32)) .cse61) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse61) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse61)))) (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_318 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_318))))) (or (and (or .cse10 .cse11 (forall ((v_arrayElimCell_311 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_311)))) (or .cse5 (and (or .cse10 (forall ((v_arrayElimCell_312 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_312))) .cse11) .cse35)) .cse32 .cse33 .cse34 (or (and .cse30 .cse31 (or (forall ((v_arrayElimCell_310 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_310))) .cse10 .cse11)) .cse17) (or .cse10 .cse11 (forall ((v_arrayElimCell_313 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_308 (_ BitVec 32))) (let ((.cse62 (select .cse9 v_arrayElimCell_313))) (or (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse62) (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse62)))))) .cse22) (or (and (or (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_305 (_ BitVec 32)) (v_arrayElimCell_309 (_ BitVec 32))) (let ((.cse63 (select .cse9 v_arrayElimCell_309))) (or (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse63) (bvule (bvadd v_arrayElimCell_305 (_ bv4 32)) .cse63)))) .cse10 .cse11) .cse37) .cse17) .cse28 (or .cse5 (and .cse12 .cse13 .cse14 .cse15 (or .cse10 (forall ((v_arrayElimCell_314 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_314))) .cse11) .cse16)) .cse39 .cse40 .cse41 (or .cse10 .cse11 (forall ((v_arrayElimCell_315 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_305 (_ BitVec 32))) (let ((.cse64 (select .cse9 v_arrayElimCell_315))) (or (bvule (bvadd v_arrayElimCell_305 (_ bv4 32)) .cse64) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse64))))) .cse42 .cse43)) (or (and (or (and (or (forall ((v_arrayElimCell_325 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_325))) .cse10 .cse11) .cse35) .cse5) (or (and .cse30 .cse31 (or (forall ((v_arrayElimCell_323 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_323))) .cse10 .cse11)) .cse17) .cse32 .cse33 .cse34 (or .cse10 (forall ((v_arrayElimCell_326 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_308 (_ BitVec 32))) (let ((.cse65 (select .cse9 v_arrayElimCell_326))) (or (bvule (bvadd v_arrayElimCell_308 (_ bv4 32)) .cse65) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) .cse65)))) .cse11) (or .cse10 .cse11 (forall ((v_arrayElimCell_324 (_ BitVec 32)) (v_arrayElimCell_306 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_306 (_ bv4 32)) (select .cse9 v_arrayElimCell_324))))) .cse22))))))) is different from true [2023-02-14 01:48:06,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [745758529] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:48:06,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:48:06,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2023-02-14 01:48:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363908674] [2023-02-14 01:48:06,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:48:06,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-14 01:48:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:48:06,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-14 01:48:06,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3221, Unknown=17, NotChecked=114, Total=3540 [2023-02-14 01:48:06,319 INFO L87 Difference]: Start difference. First operand 201 states and 227 transitions. Second operand has 47 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 41 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)