./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0134.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 26d01a9c 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-0134.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 554aa7448188134a862651a68c0992659f18748881f2b6912b6dbf17d440798c --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:49:03,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:49:03,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:49:03,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:49:03,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:49:03,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:49:03,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:49:03,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:49:03,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:49:03,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:49:03,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:49:03,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:49:03,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:49:03,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:49:03,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:49:03,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:49:03,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:49:03,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:49:03,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:49:03,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:49:03,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:49:03,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:49:03,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:49:03,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:49:03,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:49:03,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:49:03,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:49:03,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:49:03,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:49:03,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:49:03,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:49:03,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:49:03,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:49:03,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:49:03,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:49:03,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:49:03,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:49:03,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:49:03,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:49:03,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:49:03,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:49:03,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 02:49:03,351 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:49:03,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:49:03,352 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:49:03,352 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:49:03,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:49:03,353 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:49:03,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:49:03,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:49:03,354 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:49:03,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:49:03,355 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:49:03,356 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 02:49:03,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:49:03,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:49:03,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:49:03,356 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 02:49:03,357 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 02:49:03,357 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 02:49:03,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:49:03,357 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 02:49:03,357 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:49:03,357 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:49:03,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:49:03,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:49:03,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:49:03,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:49:03,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:49:03,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:49:03,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:49:03,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:49:03,359 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:49:03,360 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:49:03,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:49:03,360 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:49:03,360 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 -> 554aa7448188134a862651a68c0992659f18748881f2b6912b6dbf17d440798c [2023-02-17 02:49:03,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:49:03,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:49:03,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:49:03,644 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:49:03,644 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:49:03,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0134.i [2023-02-17 02:49:04,859 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:49:05,089 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:49:05,090 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0134.i [2023-02-17 02:49:05,102 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/783f97ad8/54e930247dee4c679a86194216097ed2/FLAG01c9c3421 [2023-02-17 02:49:05,119 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/783f97ad8/54e930247dee4c679a86194216097ed2 [2023-02-17 02:49:05,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:49:05,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:49:05,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:49:05,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:49:05,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:49:05,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:49:05" (1/1) ... [2023-02-17 02:49:05,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eff736c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:05, skipping insertion in model container [2023-02-17 02:49:05,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:49:05" (1/1) ... [2023-02-17 02:49:05,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:49:05,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:49:05,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:49:05,486 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-17 02:49:05,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f722278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:05, skipping insertion in model container [2023-02-17 02:49:05,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:49:05,489 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-17 02:49:05,491 INFO L158 Benchmark]: Toolchain (without parser) took 367.58ms. Allocated memory is still 109.1MB. Free memory was 69.7MB in the beginning and 57.6MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:49:05,491 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 84.7MB in the end (delta: 230.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:49:05,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.65ms. Allocated memory is still 109.1MB. Free memory was 69.7MB in the beginning and 57.6MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:49:05,493 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.20ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 84.7MB in the end (delta: 230.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.65ms. Allocated memory is still 109.1MB. Free memory was 69.7MB in the beginning and 57.6MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 585]: 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-0134.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 554aa7448188134a862651a68c0992659f18748881f2b6912b6dbf17d440798c --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:49:07,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:49:07,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:49:07,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:49:07,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:49:07,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:49:07,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:49:07,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:49:07,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:49:07,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:49:07,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:49:07,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:49:07,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:49:07,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:49:07,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:49:07,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:49:07,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:49:07,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:49:07,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:49:07,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:49:07,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:49:07,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:49:07,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:49:07,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:49:07,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:49:07,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:49:07,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:49:07,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:49:07,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:49:07,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:49:07,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:49:07,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:49:07,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:49:07,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:49:07,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:49:07,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:49:07,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:49:07,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:49:07,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:49:07,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:49:07,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:49:07,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-17 02:49:07,580 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:49:07,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:49:07,581 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:49:07,581 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:49:07,582 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:49:07,582 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:49:07,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:49:07,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:49:07,583 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:49:07,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:49:07,584 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:49:07,585 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 02:49:07,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:49:07,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:49:07,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:49:07,585 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 02:49:07,586 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 02:49:07,586 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 02:49:07,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:49:07,586 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 02:49:07,586 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 02:49:07,586 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 02:49:07,587 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:49:07,587 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:49:07,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:49:07,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:49:07,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:49:07,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:49:07,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:49:07,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:49:07,588 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 02:49:07,588 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 02:49:07,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:49:07,589 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:49:07,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:49:07,589 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 02:49:07,590 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:49:07,590 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 -> 554aa7448188134a862651a68c0992659f18748881f2b6912b6dbf17d440798c [2023-02-17 02:49:07,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:49:07,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:49:07,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:49:07,961 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:49:07,961 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:49:07,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0134.i [2023-02-17 02:49:09,101 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:49:09,404 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:49:09,405 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0134.i [2023-02-17 02:49:09,427 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00502773/e28eebf740c84d4b86b3f8fc1a980e16/FLAG9c54aa314 [2023-02-17 02:49:09,441 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00502773/e28eebf740c84d4b86b3f8fc1a980e16 [2023-02-17 02:49:09,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:49:09,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:49:09,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:49:09,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:49:09,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:49:09,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:09,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4414b125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09, skipping insertion in model container [2023-02-17 02:49:09,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:09,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:49:09,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:49:09,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:49:09,804 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-17 02:49:09,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:49:09,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:49:09,865 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:49:09,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:49:09,959 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:49:09,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09 WrapperNode [2023-02-17 02:49:09,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:49:09,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:49:09,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:49:09,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:49:09,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:10,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:10,035 INFO L138 Inliner]: procedures = 140, calls = 54, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 133 [2023-02-17 02:49:10,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:49:10,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:49:10,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:49:10,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:49:10,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:10,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:10,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:10,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:10,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:10,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:10,099 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:10,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:10,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:49:10,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:49:10,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:49:10,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:49:10,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09" (1/1) ... [2023-02-17 02:49:10,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:49:10,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:49:10,168 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-17 02:49:10,196 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-17 02:49:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2023-02-17 02:49:10,215 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2023-02-17 02:49:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-17 02:49:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2023-02-17 02:49:10,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2023-02-17 02:49:10,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 02:49:10,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:49:10,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 02:49:10,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 02:49:10,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 02:49:10,217 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-02-17 02:49:10,217 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-02-17 02:49:10,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 02:49:10,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-17 02:49:10,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 02:49:10,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 02:49:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-02-17 02:49:10,218 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-02-17 02:49:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:49:10,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:49:10,368 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:49:10,370 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:49:10,898 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:49:10,904 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:49:10,905 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-17 02:49:10,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:49:10 BoogieIcfgContainer [2023-02-17 02:49:10,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:49:10,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:49:10,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:49:10,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:49:10,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:49:09" (1/3) ... [2023-02-17 02:49:10,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222f4f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:49:10, skipping insertion in model container [2023-02-17 02:49:10,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:09" (2/3) ... [2023-02-17 02:49:10,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222f4f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:49:10, skipping insertion in model container [2023-02-17 02:49:10,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:49:10" (3/3) ... [2023-02-17 02:49:10,914 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0134.i [2023-02-17 02:49:10,929 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:49:10,929 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-02-17 02:49:10,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:49:10,989 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;@6d8026be, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:49:10,990 INFO L358 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2023-02-17 02:49:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 69 states have (on average 1.8695652173913044) internal successors, (129), 117 states have internal predecessors, (129), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-17 02:49:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-17 02:49:11,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:11,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-17 02:49:11,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:11,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:11,009 INFO L85 PathProgramCache]: Analyzing trace with hash 66866992, now seen corresponding path program 1 times [2023-02-17 02:49:11,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:11,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746923999] [2023-02-17 02:49:11,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:11,021 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-17 02:49:11,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:11,025 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-17 02:49:11,026 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-17 02:49:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:11,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 02:49:11,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:11,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-17 02:49:11,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:11,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:11,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746923999] [2023-02-17 02:49:11,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746923999] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:11,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:11,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:49:11,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112392376] [2023-02-17 02:49:11,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:11,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 02:49:11,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:11,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 02:49:11,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:49:11,176 INFO L87 Difference]: Start difference. First operand has 131 states, 69 states have (on average 1.8695652173913044) internal successors, (129), 117 states have internal predecessors, (129), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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-17 02:49:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:11,210 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2023-02-17 02:49:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 02:49:11,212 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-17 02:49:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:11,224 INFO L225 Difference]: With dead ends: 131 [2023-02-17 02:49:11,224 INFO L226 Difference]: Without dead ends: 129 [2023-02-17 02:49:11,226 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-17 02:49:11,231 INFO L413 NwaCegarLoop]: 142 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, 142 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-17 02:49:11,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:49:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-17 02:49:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-02-17 02:49:11,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 1.7941176470588236) internal successors, (122), 115 states have internal predecessors, (122), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-17 02:49:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2023-02-17 02:49:11,293 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 5 [2023-02-17 02:49:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:11,294 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2023-02-17 02:49:11,295 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-17 02:49:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2023-02-17 02:49:11,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-17 02:49:11,296 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:11,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-17 02:49:11,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-17 02:49:11,507 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-17 02:49:11,508 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:11,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:11,509 INFO L85 PathProgramCache]: Analyzing trace with hash 66867054, now seen corresponding path program 1 times [2023-02-17 02:49:11,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:11,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559898340] [2023-02-17 02:49:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:11,512 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-17 02:49:11,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:11,515 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-17 02:49:11,518 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-17 02:49:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:11,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 02:49:11,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:11,665 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-17 02:49:11,671 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-17 02:49:11,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:11,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:11,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559898340] [2023-02-17 02:49:11,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559898340] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:11,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:11,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:49:11,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354470303] [2023-02-17 02:49:11,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:11,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:49:11,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:11,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:49:11,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:49:11,683 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:11,873 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2023-02-17 02:49:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:49:11,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-17 02:49:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:11,875 INFO L225 Difference]: With dead ends: 151 [2023-02-17 02:49:11,875 INFO L226 Difference]: Without dead ends: 151 [2023-02-17 02:49:11,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:49:11,876 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 75 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:11,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 141 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:49:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-17 02:49:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 128. [2023-02-17 02:49:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 114 states have internal predecessors, (121), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-17 02:49:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2023-02-17 02:49:11,885 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 5 [2023-02-17 02:49:11,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:11,886 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2023-02-17 02:49:11,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2023-02-17 02:49:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-17 02:49:11,886 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:11,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-17 02:49:11,900 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-17 02:49:12,095 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-17 02:49:12,096 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash 66867055, now seen corresponding path program 1 times [2023-02-17 02:49:12,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:12,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704539298] [2023-02-17 02:49:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:12,101 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-17 02:49:12,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:12,102 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-17 02:49:12,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 02:49:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:12,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 02:49:12,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:12,168 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-17 02:49:12,171 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-17 02:49:12,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:12,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:12,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704539298] [2023-02-17 02:49:12,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704539298] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:12,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:12,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:49:12,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263345081] [2023-02-17 02:49:12,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:12,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:49:12,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:12,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:49:12,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:49:12,175 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:12,362 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2023-02-17 02:49:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:49:12,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-17 02:49:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:12,364 INFO L225 Difference]: With dead ends: 150 [2023-02-17 02:49:12,364 INFO L226 Difference]: Without dead ends: 150 [2023-02-17 02:49:12,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:49:12,365 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 28 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:12,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 211 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:49:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-17 02:49:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 127. [2023-02-17 02:49:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 113 states have internal predecessors, (120), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-17 02:49:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2023-02-17 02:49:12,373 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 5 [2023-02-17 02:49:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:12,374 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2023-02-17 02:49:12,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2023-02-17 02:49:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 02:49:12,374 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:12,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:12,386 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-17 02:49:12,575 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-17 02:49:12,576 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash -828261384, now seen corresponding path program 1 times [2023-02-17 02:49:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:12,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170584775] [2023-02-17 02:49:12,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:12,577 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-17 02:49:12,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:12,578 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-17 02:49:12,579 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-17 02:49:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:12,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 02:49:12,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:12,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:12,695 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 28 [2023-02-17 02:49:12,744 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-17 02:49:12,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:12,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:12,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170584775] [2023-02-17 02:49:12,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170584775] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:12,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:12,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:49:12,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374088652] [2023-02-17 02:49:12,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:12,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:49:12,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:12,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:49:12,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:12,748 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:13,118 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2023-02-17 02:49:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:49:13,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-17 02:49:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:13,120 INFO L225 Difference]: With dead ends: 165 [2023-02-17 02:49:13,120 INFO L226 Difference]: Without dead ends: 165 [2023-02-17 02:49:13,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:49:13,121 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 179 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:13,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 208 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:49:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-17 02:49:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 142. [2023-02-17 02:49:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 83 states have (on average 1.783132530120482) internal successors, (148), 127 states have internal predecessors, (148), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-17 02:49:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2023-02-17 02:49:13,131 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 8 [2023-02-17 02:49:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:13,131 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2023-02-17 02:49:13,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2023-02-17 02:49:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 02:49:13,132 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:13,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:13,147 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-17 02:49:13,342 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-17 02:49:13,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:13,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash -828261383, now seen corresponding path program 1 times [2023-02-17 02:49:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:13,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766028675] [2023-02-17 02:49:13,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:13,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:49:13,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:13,346 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-17 02:49:13,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 02:49:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:13,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 02:49:13,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:13,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:49:13,452 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-17 02:49:13,477 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-17 02:49:13,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:13,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:13,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766028675] [2023-02-17 02:49:13,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766028675] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:13,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:13,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:49:13,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985911844] [2023-02-17 02:49:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:13,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:13,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:13,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:13,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:13,480 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:13,955 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2023-02-17 02:49:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:49:13,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-17 02:49:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:13,957 INFO L225 Difference]: With dead ends: 146 [2023-02-17 02:49:13,957 INFO L226 Difference]: Without dead ends: 146 [2023-02-17 02:49:13,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:49:13,958 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 303 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:13,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 146 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:49:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-17 02:49:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2023-02-17 02:49:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.6962025316455696) internal successors, (134), 119 states have internal predecessors, (134), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-17 02:49:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2023-02-17 02:49:13,963 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 8 [2023-02-17 02:49:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:13,963 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2023-02-17 02:49:13,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2023-02-17 02:49:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 02:49:13,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:13,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:13,973 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-17 02:49:14,172 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-17 02:49:14,173 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:14,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:14,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1390240455, now seen corresponding path program 1 times [2023-02-17 02:49:14,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:14,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734844520] [2023-02-17 02:49:14,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:14,174 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-17 02:49:14,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:14,175 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-17 02:49:14,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-17 02:49:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:14,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:49:14,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:14,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:14,298 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 16 treesize of output 26 [2023-02-17 02:49:14,312 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-17 02:49:14,340 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-17 02:49:14,366 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-17 02:49:14,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:14,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:14,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734844520] [2023-02-17 02:49:14,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734844520] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:14,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:14,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 02:49:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59398301] [2023-02-17 02:49:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:14,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 02:49:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 02:49:14,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:49:14,369 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-17 02:49:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:14,809 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2023-02-17 02:49:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 02:49:14,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 10 [2023-02-17 02:49:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:14,811 INFO L225 Difference]: With dead ends: 155 [2023-02-17 02:49:14,811 INFO L226 Difference]: Without dead ends: 155 [2023-02-17 02:49:14,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-02-17 02:49:14,812 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 37 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:14,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 656 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:49:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-17 02:49:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2023-02-17 02:49:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 91 states have (on average 1.6813186813186813) internal successors, (153), 132 states have internal predecessors, (153), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2023-02-17 02:49:14,820 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 10 [2023-02-17 02:49:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:14,820 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2023-02-17 02:49:14,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-17 02:49:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2023-02-17 02:49:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 02:49:14,821 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:14,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:14,833 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-17 02:49:15,031 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-17 02:49:15,031 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:15,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1390240454, now seen corresponding path program 1 times [2023-02-17 02:49:15,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:15,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799154222] [2023-02-17 02:49:15,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:15,032 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-17 02:49:15,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:15,034 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-17 02:49:15,037 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-17 02:49:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:15,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 02:49:15,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:15,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:15,157 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 28 [2023-02-17 02:49:15,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:15,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 02:49:15,196 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-17 02:49:15,205 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-17 02:49:15,254 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-17 02:49:15,258 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-17 02:49:15,281 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-17 02:49:15,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:15,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:15,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799154222] [2023-02-17 02:49:15,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799154222] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:15,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:15,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 02:49:15,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553280431] [2023-02-17 02:49:15,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:15,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 02:49:15,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:15,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 02:49:15,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:49:15,283 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-17 02:49:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:15,900 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2023-02-17 02:49:15,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 02:49:15,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 10 [2023-02-17 02:49:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:15,902 INFO L225 Difference]: With dead ends: 154 [2023-02-17 02:49:15,902 INFO L226 Difference]: Without dead ends: 154 [2023-02-17 02:49:15,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-02-17 02:49:15,903 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 44 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:15,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 599 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 02:49:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-17 02:49:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2023-02-17 02:49:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 91 states have (on average 1.6703296703296704) internal successors, (152), 132 states have internal predecessors, (152), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2023-02-17 02:49:15,912 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 10 [2023-02-17 02:49:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:15,912 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2023-02-17 02:49:15,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-17 02:49:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2023-02-17 02:49:15,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 02:49:15,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:15,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:15,925 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-17 02:49:16,125 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-17 02:49:16,125 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:16,126 INFO L85 PathProgramCache]: Analyzing trace with hash -147781147, now seen corresponding path program 1 times [2023-02-17 02:49:16,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:16,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156701518] [2023-02-17 02:49:16,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:16,127 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-17 02:49:16,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:16,128 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-17 02:49:16,129 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-17 02:49:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:16,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 02:49:16,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:16,214 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-17 02:49:16,236 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-17 02:49:16,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:16,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:16,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156701518] [2023-02-17 02:49:16,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156701518] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:16,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:16,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:16,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346678570] [2023-02-17 02:49:16,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:16,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:16,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:16,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:16,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:16,239 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-17 02:49:16,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:16,567 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2023-02-17 02:49:16,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 02:49:16,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-17 02:49:16,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:16,569 INFO L225 Difference]: With dead ends: 169 [2023-02-17 02:49:16,569 INFO L226 Difference]: Without dead ends: 169 [2023-02-17 02:49:16,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-17 02:49:16,570 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 113 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:16,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 301 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:49:16,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-17 02:49:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2023-02-17 02:49:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 91 states have (on average 1.6153846153846154) internal successors, (147), 131 states have internal predecessors, (147), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2023-02-17 02:49:16,576 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 167 transitions. Word has length 11 [2023-02-17 02:49:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:16,576 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 167 transitions. [2023-02-17 02:49:16,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-17 02:49:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 167 transitions. [2023-02-17 02:49:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 02:49:16,577 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:16,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:16,586 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-17 02:49:16,785 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-17 02:49:16,785 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:16,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash -147781146, now seen corresponding path program 1 times [2023-02-17 02:49:16,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:16,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8251124] [2023-02-17 02:49:16,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:16,787 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-17 02:49:16,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:16,788 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-17 02:49:16,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 02:49:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:16,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 02:49:16,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:16,878 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-17 02:49:16,897 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-17 02:49:16,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:16,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:16,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8251124] [2023-02-17 02:49:16,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8251124] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:16,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:16,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736561017] [2023-02-17 02:49:16,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:16,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:16,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:16,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:16,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:16,901 INFO L87 Difference]: Start difference. First operand 147 states and 167 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-17 02:49:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:17,221 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2023-02-17 02:49:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:49:17,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-17 02:49:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:17,222 INFO L225 Difference]: With dead ends: 169 [2023-02-17 02:49:17,222 INFO L226 Difference]: Without dead ends: 169 [2023-02-17 02:49:17,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-17 02:49:17,223 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 57 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:17,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 436 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:49:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-17 02:49:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2023-02-17 02:49:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 91 states have (on average 1.5714285714285714) internal successors, (143), 131 states have internal predecessors, (143), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 163 transitions. [2023-02-17 02:49:17,229 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 163 transitions. Word has length 11 [2023-02-17 02:49:17,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:17,229 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 163 transitions. [2023-02-17 02:49:17,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-17 02:49:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 163 transitions. [2023-02-17 02:49:17,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 02:49:17,229 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:17,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:17,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-02-17 02:49:17,438 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-17 02:49:17,439 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting list_addErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:17,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash -283761464, now seen corresponding path program 1 times [2023-02-17 02:49:17,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:17,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129715546] [2023-02-17 02:49:17,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:17,440 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-17 02:49:17,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:17,441 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-17 02:49:17,444 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-17 02:49:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:17,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 02:49:17,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:17,541 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-17 02:49:17,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:17,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:17,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129715546] [2023-02-17 02:49:17,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129715546] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:17,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:17,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:49:17,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597151620] [2023-02-17 02:49:17,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:17,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:49:17,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:17,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:49:17,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:49:17,544 INFO L87 Difference]: Start difference. First operand 147 states and 163 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 02:49:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:17,677 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2023-02-17 02:49:17,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:49:17,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2023-02-17 02:49:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:17,678 INFO L225 Difference]: With dead ends: 146 [2023-02-17 02:49:17,678 INFO L226 Difference]: Without dead ends: 146 [2023-02-17 02:49:17,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-17 02:49:17,679 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 22 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:17,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 269 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:49:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-17 02:49:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2023-02-17 02:49:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 130 states have internal predecessors, (140), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2023-02-17 02:49:17,684 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 13 [2023-02-17 02:49:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:17,684 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2023-02-17 02:49:17,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 02:49:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2023-02-17 02:49:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 02:49:17,685 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:17,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:17,693 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-17 02:49:17,889 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-17 02:49:17,889 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting list_addErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash -283761463, now seen corresponding path program 1 times [2023-02-17 02:49:17,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:17,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98489860] [2023-02-17 02:49:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:17,890 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-17 02:49:17,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:17,891 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-17 02:49:17,892 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-17 02:49:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:17,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 02:49:17,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:18,002 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-17 02:49:18,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:18,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:18,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98489860] [2023-02-17 02:49:18,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98489860] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:18,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:18,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55534092] [2023-02-17 02:49:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:18,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:49:18,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:18,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:49:18,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:49:18,004 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-17 02:49:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:18,345 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2023-02-17 02:49:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 02:49:18,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 13 [2023-02-17 02:49:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:18,347 INFO L225 Difference]: With dead ends: 148 [2023-02-17 02:49:18,347 INFO L226 Difference]: Without dead ends: 148 [2023-02-17 02:49:18,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:49:18,348 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 161 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:18,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 514 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:49:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-17 02:49:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2023-02-17 02:49:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 130 states have internal predecessors, (138), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2023-02-17 02:49:18,353 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 13 [2023-02-17 02:49:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:18,353 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2023-02-17 02:49:18,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-17 02:49:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2023-02-17 02:49:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 02:49:18,354 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:18,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:18,367 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-17 02:49:18,554 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-17 02:49:18,555 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:18,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:18,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1628861501, now seen corresponding path program 1 times [2023-02-17 02:49:18,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:18,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808976688] [2023-02-17 02:49:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:18,556 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-17 02:49:18,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:18,557 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-17 02:49:18,560 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-17 02:49:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:18,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 02:49:18,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:18,689 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-17 02:49:18,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:18,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:18,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808976688] [2023-02-17 02:49:18,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808976688] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:18,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:18,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:49:18,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194658889] [2023-02-17 02:49:18,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:18,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:49:18,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:18,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:49:18,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:49:18,691 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:19,019 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2023-02-17 02:49:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:49:19,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-02-17 02:49:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:19,020 INFO L225 Difference]: With dead ends: 145 [2023-02-17 02:49:19,020 INFO L226 Difference]: Without dead ends: 145 [2023-02-17 02:49:19,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:49:19,021 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 151 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:19,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 294 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:49:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-17 02:49:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2023-02-17 02:49:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 129 states have internal predecessors, (137), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2023-02-17 02:49:19,026 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 22 [2023-02-17 02:49:19,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:19,026 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2023-02-17 02:49:19,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2023-02-17 02:49:19,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 02:49:19,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:19,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:19,035 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-17 02:49:19,235 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-17 02:49:19,236 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting list_emptyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:19,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:19,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1628861500, now seen corresponding path program 1 times [2023-02-17 02:49:19,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:19,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790769631] [2023-02-17 02:49:19,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:19,237 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-17 02:49:19,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:19,238 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-17 02:49:19,239 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-17 02:49:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:19,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 02:49:19,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:19,418 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-17 02:49:19,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:19,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:19,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790769631] [2023-02-17 02:49:19,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790769631] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:19,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:19,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:49:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251923304] [2023-02-17 02:49:19,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:19,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 02:49:19,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:19,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 02:49:19,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:49:19,421 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:19,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:19,987 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2023-02-17 02:49:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:49:19,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-02-17 02:49:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:19,989 INFO L225 Difference]: With dead ends: 144 [2023-02-17 02:49:19,989 INFO L226 Difference]: Without dead ends: 144 [2023-02-17 02:49:19,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:49:19,990 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 151 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:19,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 299 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 02:49:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-17 02:49:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2023-02-17 02:49:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 128 states have internal predecessors, (136), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:49:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2023-02-17 02:49:19,995 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 22 [2023-02-17 02:49:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:19,995 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2023-02-17 02:49:19,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:49:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2023-02-17 02:49:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 02:49:19,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:19,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:20,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-17 02:49:20,197 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-17 02:49:20,197 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:20,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:20,198 INFO L85 PathProgramCache]: Analyzing trace with hash 508658616, now seen corresponding path program 1 times [2023-02-17 02:49:20,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:20,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388741057] [2023-02-17 02:49:20,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:20,198 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-17 02:49:20,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:20,199 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-17 02:49:20,200 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-17 02:49:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:20,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-17 02:49:20,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:20,422 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-17 02:49:20,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:20,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:20,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 31 treesize of output 151 [2023-02-17 02:49:20,561 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 50 treesize of output 44 [2023-02-17 02:49:20,847 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 151 treesize of output 119 [2023-02-17 02:49:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:21,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:49:21,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_345) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv1 1))) is different from false [2023-02-17 02:49:21,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:21,440 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 23 treesize of output 24 [2023-02-17 02:49:21,444 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:49:21,447 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 21 treesize of output 13 [2023-02-17 02:49:21,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:21,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388741057] [2023-02-17 02:49:21,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388741057] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:49:21,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2003787421] [2023-02-17 02:49:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:21,483 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:49:21,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:49:21,485 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-17 02:49:21,500 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-17 02:49:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:21,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-17 02:49:21,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:21,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:21,839 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 28 [2023-02-17 02:49:22,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:22,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:22,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 58 treesize of output 166 [2023-02-17 02:49:22,330 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 52 treesize of output 46 [2023-02-17 02:49:22,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2023-02-17 02:49:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:22,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:49:22,614 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_410) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv1 1))) is different from false [2023-02-17 02:49:22,623 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_gl_insert_~node~0#1.base_13| (_ BitVec 32)) (v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (_ BitVec 1))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_13| v_ArrVal_409) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~0#1.base_13| v_ArrVal_410) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_13|) (_ bv0 1))))) is different from false [2023-02-17 02:49:22,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:22,636 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 23 treesize of output 24 [2023-02-17 02:49:22,638 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:49:22,640 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 21 treesize of output 13 [2023-02-17 02:49:24,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2003787421] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:49:24,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:49:24,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 26 [2023-02-17 02:49:24,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315527256] [2023-02-17 02:49:24,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:49:24,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-17 02:49:24,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:24,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-17 02:49:24,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1034, Unknown=18, NotChecked=204, Total=1406 [2023-02-17 02:49:24,690 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 27 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:49:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:28,118 INFO L93 Difference]: Finished difference Result 225 states and 241 transitions. [2023-02-17 02:49:28,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-17 02:49:28,119 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-02-17 02:49:28,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:28,120 INFO L225 Difference]: With dead ends: 225 [2023-02-17 02:49:28,120 INFO L226 Difference]: Without dead ends: 225 [2023-02-17 02:49:28,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=432, Invalid=2112, Unknown=18, NotChecked=300, Total=2862 [2023-02-17 02:49:28,122 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 634 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:28,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 814 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-02-17 02:49:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-17 02:49:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 183. [2023-02-17 02:49:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 123 states have (on average 1.5040650406504066) internal successors, (185), 161 states have internal predecessors, (185), 14 states have call successors, (14), 9 states have call predecessors, (14), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-17 02:49:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2023-02-17 02:49:28,129 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 26 [2023-02-17 02:49:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:28,129 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2023-02-17 02:49:28,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:49:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2023-02-17 02:49:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 02:49:28,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:28,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:28,148 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-17 02:49:28,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-02-17 02:49:28,532 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-17 02:49:28,532 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:28,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:28,533 INFO L85 PathProgramCache]: Analyzing trace with hash 508658617, now seen corresponding path program 1 times [2023-02-17 02:49:28,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:28,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421452604] [2023-02-17 02:49:28,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:28,533 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-17 02:49:28,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:28,534 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-17 02:49:28,537 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-17 02:49:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:28,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-17 02:49:28,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:28,760 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-17 02:49:28,763 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-17 02:49:28,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:28,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:28,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:28,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 73 [2023-02-17 02:49:28,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:28,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 38 [2023-02-17 02:49:28,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 53 treesize of output 51 [2023-02-17 02:49:28,938 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 16 treesize of output 18 [2023-02-17 02:49:29,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 02:49:29,027 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 37 treesize of output 25 [2023-02-17 02:49:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:29,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:49:29,458 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_479) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_478) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_479) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_479) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2023-02-17 02:49:29,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:29,838 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 44 treesize of output 45 [2023-02-17 02:49:29,841 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:49:29,843 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 34 [2023-02-17 02:49:29,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:29,847 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 29 treesize of output 30 [2023-02-17 02:49:29,849 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:49:29,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-02-17 02:49:29,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:29,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-17 02:49:29,859 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:49:29,860 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 20 treesize of output 12 [2023-02-17 02:49:29,864 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:29,865 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 43 treesize of output 34 [2023-02-17 02:49:29,869 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:49:29,870 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 28 treesize of output 16 [2023-02-17 02:49:29,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:29,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421452604] [2023-02-17 02:49:29,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421452604] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:49:29,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1847535608] [2023-02-17 02:49:29,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:29,983 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:49:29,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:49:29,985 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 02:49:29,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-02-17 02:49:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:30,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-17 02:49:30,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:30,399 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-17 02:49:30,402 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-17 02:49:30,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:30,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:31,006 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:31,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 73 [2023-02-17 02:49:31,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:31,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 38 [2023-02-17 02:49:31,131 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 64 treesize of output 60 [2023-02-17 02:49:31,138 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 16 treesize of output 18 [2023-02-17 02:49:31,382 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 49 treesize of output 33 [2023-02-17 02:49:31,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 02:49:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:31,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:49:31,444 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_551) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_552) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_551) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_551) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false [2023-02-17 02:49:31,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:31,941 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 22 treesize of output 23 [2023-02-17 02:49:31,943 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:49:31,945 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 20 treesize of output 12 [2023-02-17 02:49:31,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:31,948 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 43 treesize of output 34 [2023-02-17 02:49:31,950 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:49:31,952 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 28 treesize of output 16 [2023-02-17 02:49:31,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:31,956 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 44 treesize of output 45 [2023-02-17 02:49:31,963 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:49:31,965 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 34 [2023-02-17 02:49:31,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:31,970 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 29 treesize of output 30 [2023-02-17 02:49:31,972 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:49:31,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-02-17 02:49:32,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1847535608] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:49:32,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:49:32,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-02-17 02:49:32,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451873625] [2023-02-17 02:49:32,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:49:32,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-17 02:49:32,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:32,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-17 02:49:32,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1118, Unknown=9, NotChecked=138, Total=1406 [2023-02-17 02:49:32,139 INFO L87 Difference]: Start difference. First operand 183 states and 213 transitions. Second operand has 27 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 23 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:49:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:36,308 INFO L93 Difference]: Finished difference Result 220 states and 240 transitions. [2023-02-17 02:49:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-17 02:49:36,309 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 23 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-02-17 02:49:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:36,310 INFO L225 Difference]: With dead ends: 220 [2023-02-17 02:49:36,310 INFO L226 Difference]: Without dead ends: 220 [2023-02-17 02:49:36,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=438, Invalid=2111, Unknown=9, NotChecked=198, Total=2756 [2023-02-17 02:49:36,312 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 735 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:36,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 720 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-02-17 02:49:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-17 02:49:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 169. [2023-02-17 02:49:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 148 states have internal predecessors, (172), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-17 02:49:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2023-02-17 02:49:36,318 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 26 [2023-02-17 02:49:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:36,318 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2023-02-17 02:49:36,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 23 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:49:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2023-02-17 02:49:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 02:49:36,319 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:36,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:36,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-02-17 02:49:36,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-02-17 02:49:36,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 02:49:36,735 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:36,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:36,735 INFO L85 PathProgramCache]: Analyzing trace with hash -961621695, now seen corresponding path program 1 times [2023-02-17 02:49:36,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:36,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929217642] [2023-02-17 02:49:36,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:36,736 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-17 02:49:36,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:36,738 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:49:36,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-17 02:49:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:36,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 02:49:36,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:36,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:36,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-02-17 02:49:36,992 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-17 02:49:36,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:36,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:36,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929217642] [2023-02-17 02:49:36,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929217642] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:36,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:36,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 02:49:36,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680645396] [2023-02-17 02:49:36,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:36,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:49:36,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:36,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:49:36,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:49:36,995 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:49:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:37,741 INFO L93 Difference]: Finished difference Result 191 states and 210 transitions. [2023-02-17 02:49:37,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 02:49:37,742 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2023-02-17 02:49:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:37,743 INFO L225 Difference]: With dead ends: 191 [2023-02-17 02:49:37,743 INFO L226 Difference]: Without dead ends: 191 [2023-02-17 02:49:37,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-02-17 02:49:37,744 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 210 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:37,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 728 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 02:49:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-17 02:49:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 167. [2023-02-17 02:49:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.5504587155963303) internal successors, (169), 146 states have internal predecessors, (169), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-17 02:49:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2023-02-17 02:49:37,749 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 31 [2023-02-17 02:49:37,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:37,749 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2023-02-17 02:49:37,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:49:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2023-02-17 02:49:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 02:49:37,750 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:37,750 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:37,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-17 02:49:37,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:49:37,962 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:37,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:37,963 INFO L85 PathProgramCache]: Analyzing trace with hash -149006513, now seen corresponding path program 1 times [2023-02-17 02:49:37,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:37,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612189315] [2023-02-17 02:49:37,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:37,964 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-17 02:49:37,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:37,965 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-17 02:49:37,967 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-17 02:49:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:38,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 02:49:38,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:38,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:38,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-02-17 02:49:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:49:38,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:38,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:38,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612189315] [2023-02-17 02:49:38,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612189315] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:38,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:38,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 02:49:38,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478290793] [2023-02-17 02:49:38,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:38,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:49:38,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:38,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:49:38,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:49:38,217 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 02:49:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:38,844 INFO L93 Difference]: Finished difference Result 191 states and 209 transitions. [2023-02-17 02:49:38,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 02:49:38,844 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2023-02-17 02:49:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:38,846 INFO L225 Difference]: With dead ends: 191 [2023-02-17 02:49:38,846 INFO L226 Difference]: Without dead ends: 191 [2023-02-17 02:49:38,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-02-17 02:49:38,847 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 197 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:38,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 609 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 02:49:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-17 02:49:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 167. [2023-02-17 02:49:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 146 states have internal predecessors, (168), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-17 02:49:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2023-02-17 02:49:38,852 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 37 [2023-02-17 02:49:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:38,853 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2023-02-17 02:49:38,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 02:49:38,853 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2023-02-17 02:49:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 02:49:38,853 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:38,854 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:38,865 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-17 02:49:39,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:49:39,064 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:39,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1437435270, now seen corresponding path program 1 times [2023-02-17 02:49:39,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:39,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269817494] [2023-02-17 02:49:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:39,065 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-17 02:49:39,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:39,066 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:49:39,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-17 02:49:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:39,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 02:49:39,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:39,239 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-17 02:49:39,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:39,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:39,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 101 [2023-02-17 02:49:39,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 02:49:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 02:49:39,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:49:39,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269817494] [2023-02-17 02:49:39,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269817494] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:39,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:39,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 02:49:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990792550] [2023-02-17 02:49:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:39,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:49:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:39,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:49:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:49:39,406 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 02:49:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:40,904 INFO L93 Difference]: Finished difference Result 252 states and 283 transitions. [2023-02-17 02:49:40,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 02:49:40,905 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2023-02-17 02:49:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:40,906 INFO L225 Difference]: With dead ends: 252 [2023-02-17 02:49:40,906 INFO L226 Difference]: Without dead ends: 252 [2023-02-17 02:49:40,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2023-02-17 02:49:40,907 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 472 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:40,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 487 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-17 02:49:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-02-17 02:49:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 172. [2023-02-17 02:49:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 150 states have internal predecessors, (172), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-17 02:49:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 198 transitions. [2023-02-17 02:49:40,914 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 198 transitions. Word has length 39 [2023-02-17 02:49:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:40,914 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 198 transitions. [2023-02-17 02:49:40,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 02:49:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 198 transitions. [2023-02-17 02:49:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 02:49:40,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:40,915 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:40,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-17 02:49:41,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:49:41,126 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:49:41,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1437435269, now seen corresponding path program 1 times [2023-02-17 02:49:41,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:49:41,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147234925] [2023-02-17 02:49:41,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:41,128 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-17 02:49:41,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:49:41,129 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-17 02:49:41,132 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-17 02:49:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:41,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-17 02:49:41,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:41,307 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-17 02:49:41,309 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-17 02:49:41,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:41,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:41,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:41,400 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 20 treesize of output 42 [2023-02-17 02:49:41,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:41,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 38 [2023-02-17 02:49:41,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 02:49:41,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 02:49:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:41,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:49:43,741 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4294967292 32) (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (let ((.cse2 (bvadd (_ bv4 32) .cse1)) (.cse0 (forall ((|v_ULTIMATE.start_gl_sort_~#dst~0#1.base_9| (_ BitVec 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_sort_~#dst~0#1.base_9|) (_ bv0 1)))))) (and (or .cse0 (bvule .cse1 .cse2)) (forall ((|v_ULTIMATE.start_gl_sort_~#dst~0#1.base_9| (_ BitVec 32))) (or (forall ((v_ArrVal_743 (_ BitVec 32))) (bvule .cse2 (select (store |c_#length| |v_ULTIMATE.start_gl_sort_~#dst~0#1.base_9| v_ArrVal_743) (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_sort_~#dst~0#1.base_9|) (_ bv0 1))))) (or (bvule (_ bv0 32) .cse1) .cse0)))) is different from false [2023-02-17 02:49:43,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:49:43,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147234925] [2023-02-17 02:49:43,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147234925] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:49:43,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1138463838] [2023-02-17 02:49:43,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:43,749 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:49:43,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:49:43,750 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 02:49:43,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-02-17 02:49:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:44,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-17 02:49:44,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:49:44,079 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-17 02:49:44,106 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-17 02:49:44,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:44,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:49:44,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:49:44,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:49:44,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:44,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 38 [2023-02-17 02:49:44,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:49:44,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 93 [2023-02-17 02:49:44,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 02:49:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:49:45,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:49:45,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1138463838] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:49:45,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:49:45,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2023-02-17 02:49:45,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111777641] [2023-02-17 02:49:45,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:49:45,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-17 02:49:45,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:49:45,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 02:49:45,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=835, Unknown=1, NotChecked=58, Total=992 [2023-02-17 02:49:45,413 INFO L87 Difference]: Start difference. First operand 172 states and 198 transitions. Second operand has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 02:49:48,563 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-17 02:49:50,806 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-17 02:50:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:50:04,440 INFO L93 Difference]: Finished difference Result 257 states and 281 transitions. [2023-02-17 02:50:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-17 02:50:04,441 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2023-02-17 02:50:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:50:04,443 INFO L225 Difference]: With dead ends: 257 [2023-02-17 02:50:04,443 INFO L226 Difference]: Without dead ends: 257 [2023-02-17 02:50:04,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=364, Invalid=1991, Unknown=1, NotChecked=94, Total=2450 [2023-02-17 02:50:04,444 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 786 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 136 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-02-17 02:50:04,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 817 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1948 Invalid, 2 Unknown, 0 Unchecked, 13.7s Time] [2023-02-17 02:50:04,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-02-17 02:50:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 177. [2023-02-17 02:50:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 117 states have (on average 1.4871794871794872) internal successors, (174), 154 states have internal predecessors, (174), 13 states have call successors, (13), 10 states have call predecessors, (13), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-17 02:50:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 200 transitions. [2023-02-17 02:50:04,451 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 200 transitions. Word has length 39 [2023-02-17 02:50:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:50:04,451 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 200 transitions. [2023-02-17 02:50:04,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 02:50:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 200 transitions. [2023-02-17 02:50:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 02:50:04,452 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:50:04,453 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:50:04,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2023-02-17 02:50:04,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-02-17 02:50:04,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-17 02:50:04,857 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-02-17 02:50:04,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:50:04,857 INFO L85 PathProgramCache]: Analyzing trace with hash -410698476, now seen corresponding path program 1 times [2023-02-17 02:50:04,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:50:04,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441002440] [2023-02-17 02:50:04,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:50:04,858 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-17 02:50:04,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:50:04,859 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:50:04,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-17 02:50:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:50:05,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-17 02:50:05,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:50:05,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:50:05,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 02:50:05,104 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-17 02:50:05,108 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-17 02:50:05,158 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 15 treesize of output 11 [2023-02-17 02:50:05,190 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 25 treesize of output 24 [2023-02-17 02:50:05,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:50:05,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 46 [2023-02-17 02:50:05,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:50:05,237 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 43 treesize of output 35 [2023-02-17 02:50:05,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2023-02-17 02:50:05,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:50:05,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 109 treesize of output 270