./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 207ea7efa81a205528159a2c1c5225b996f0eb4901bda418907cbc964f19b86c --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:23:19,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:23:19,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:23:19,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:23:19,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:23:19,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:23:19,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:23:19,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:23:19,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:23:19,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:23:19,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:23:19,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:23:19,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:23:19,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:23:19,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:23:19,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:23:19,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:23:19,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:23:19,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:23:19,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:23:19,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:23:19,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:23:19,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:23:19,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:23:19,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:23:19,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:23:19,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:23:19,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:23:19,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:23:19,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:23:19,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:23:19,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:23:19,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:23:19,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:23:19,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:23:19,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:23:19,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:23:19,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:23:19,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:23:19,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:23:19,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:23:19,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:23:19,665 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:23:19,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:23:19,666 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:23:19,666 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:23:19,667 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:23:19,667 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:23:19,667 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:23:19,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:23:19,668 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:23:19,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:23:19,668 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:23:19,669 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:23:19,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:23:19,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:23:19,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:23:19,669 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:23:19,669 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:23:19,669 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:23:19,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:23:19,670 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:23:19,670 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:23:19,670 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:23:19,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:23:19,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:23:19,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:23:19,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:23:19,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:23:19,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:23:19,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:23:19,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:23:19,671 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:23:19,671 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:23:19,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:23:19,672 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:23:19,672 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 -> 207ea7efa81a205528159a2c1c5225b996f0eb4901bda418907cbc964f19b86c [2023-02-16 03:23:19,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:23:19,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:23:19,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:23:19,871 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:23:19,871 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:23:19,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2023-02-16 03:23:20,935 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:23:21,188 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:23:21,193 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2023-02-16 03:23:21,202 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03c2f8ee/164c9dbe8ad24d2384a81d77e5642658/FLAG3fc8ac102 [2023-02-16 03:23:21,212 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03c2f8ee/164c9dbe8ad24d2384a81d77e5642658 [2023-02-16 03:23:21,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:23:21,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:23:21,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:23:21,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:23:21,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:23:21,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:23:21" (1/1) ... [2023-02-16 03:23:21,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77962884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:21, skipping insertion in model container [2023-02-16 03:23:21,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:23:21" (1/1) ... [2023-02-16 03:23:21,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:23:21,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:23:21,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:23:21,555 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-16 03:23:21,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@776f2dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:21, skipping insertion in model container [2023-02-16 03:23:21,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:23:21,558 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-16 03:23:21,559 INFO L158 Benchmark]: Toolchain (without parser) took 343.78ms. Allocated memory is still 155.2MB. Free memory was 121.3MB in the beginning and 107.4MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 03:23:21,560 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory was 100.8MB in the beginning and 100.8MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:23:21,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.28ms. Allocated memory is still 155.2MB. Free memory was 120.6MB in the beginning and 107.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 03:23:21,562 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.13ms. Allocated memory is still 127.9MB. Free memory was 100.8MB in the beginning and 100.8MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.28ms. Allocated memory is still 155.2MB. Free memory was 120.6MB in the beginning and 107.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 207ea7efa81a205528159a2c1c5225b996f0eb4901bda418907cbc964f19b86c --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:23:23,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:23:23,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:23:23,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:23:23,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:23:23,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:23:23,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:23:23,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:23:23,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:23:23,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:23:23,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:23:23,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:23:23,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:23:23,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:23:23,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:23:23,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:23:23,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:23:23,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:23:23,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:23:23,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:23:23,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:23:23,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:23:23,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:23:23,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:23:23,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:23:23,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:23:23,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:23:23,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:23:23,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:23:23,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:23:23,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:23:23,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:23:23,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:23:23,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:23:23,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:23:23,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:23:23,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:23:23,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:23:23,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:23:23,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:23:23,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:23:23,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-16 03:23:23,510 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:23:23,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:23:23,511 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:23:23,511 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:23:23,512 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:23:23,512 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:23:23,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:23:23,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:23:23,513 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:23:23,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:23:23,514 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:23:23,514 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:23:23,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:23:23,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:23:23,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:23:23,515 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:23:23,515 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:23:23,515 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:23:23,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:23:23,515 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:23:23,516 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:23:23,516 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:23:23,516 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:23:23,516 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:23:23,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:23:23,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:23:23,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:23:23,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:23:23,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:23:23,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:23:23,517 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:23:23,518 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:23,518 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:23:23,518 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:23:23,518 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:23:23,518 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:23:23,519 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:23:23,519 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 -> 207ea7efa81a205528159a2c1c5225b996f0eb4901bda418907cbc964f19b86c [2023-02-16 03:23:23,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:23:23,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:23:23,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:23:23,802 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:23:23,803 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:23:23,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2023-02-16 03:23:24,886 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:23:25,116 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:23:25,116 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2023-02-16 03:23:25,126 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f857932d/3f51dce4a87b4e4a99f21d4bf7a678f9/FLAG67fd1b030 [2023-02-16 03:23:25,136 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f857932d/3f51dce4a87b4e4a99f21d4bf7a678f9 [2023-02-16 03:23:25,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:23:25,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:23:25,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:23:25,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:23:25,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:23:25,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d67c5f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25, skipping insertion in model container [2023-02-16 03:23:25,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:23:25,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:23:25,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:23:25,468 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-16 03:23:25,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:23:25,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:23:25,562 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:23:25,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:23:25,673 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:23:25,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25 WrapperNode [2023-02-16 03:23:25,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:23:25,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:23:25,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:23:25,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:23:25,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,738 INFO L138 Inliner]: procedures = 167, calls = 91, calls flagged for inlining = 22, calls inlined = 4, statements flattened = 66 [2023-02-16 03:23:25,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:23:25,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:23:25,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:23:25,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:23:25,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,778 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:23:25,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:23:25,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:23:25,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:23:25,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25" (1/1) ... [2023-02-16 03:23:25,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:23:25,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:23:25,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 03:23:25,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 03:23:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-16 03:23:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-16 03:23:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:23:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:23:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:23:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:23:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:23:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 03:23:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:23:25,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:23:26,006 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:23:26,009 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:23:26,211 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:23:26,216 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:23:26,216 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-16 03:23:26,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:23:26 BoogieIcfgContainer [2023-02-16 03:23:26,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:23:26,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:23:26,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:23:26,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:23:26,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:23:25" (1/3) ... [2023-02-16 03:23:26,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21822e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:23:26, skipping insertion in model container [2023-02-16 03:23:26,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:23:25" (2/3) ... [2023-02-16 03:23:26,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21822e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:23:26, skipping insertion in model container [2023-02-16 03:23:26,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:23:26" (3/3) ... [2023-02-16 03:23:26,223 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test10-1.i [2023-02-16 03:23:26,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:23:26,236 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-02-16 03:23:26,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:23:26,278 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;@65c06090, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:23:26,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2023-02-16 03:23:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 37 states have (on average 2.027027027027027) internal successors, (75), 71 states have internal predecessors, (75), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:23:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:23:26,287 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:26,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:26,288 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1838783457, now seen corresponding path program 1 times [2023-02-16 03:23:26,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:26,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569748839] [2023-02-16 03:23:26,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:26,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:26,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:26,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:26,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-16 03:23:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:26,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:23:26,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:23:26,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:23:26,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:26,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569748839] [2023-02-16 03:23:26,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569748839] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:23:26,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:23:26,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:23:26,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447684387] [2023-02-16 03:23:26,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:23:26,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:23:26,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:26,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:23:26,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:23:26,478 INFO L87 Difference]: Start difference. First operand has 77 states, 37 states have (on average 2.027027027027027) internal successors, (75), 71 states have internal predecessors, (75), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:23:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:26,679 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2023-02-16 03:23:26,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:23:26,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-16 03:23:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:26,687 INFO L225 Difference]: With dead ends: 148 [2023-02-16 03:23:26,687 INFO L226 Difference]: Without dead ends: 144 [2023-02-16 03:23:26,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:23:26,690 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 67 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:26,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 377 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:23:26,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-16 03:23:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 79. [2023-02-16 03:23:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 72 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-16 03:23:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2023-02-16 03:23:26,765 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 11 [2023-02-16 03:23:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:26,765 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2023-02-16 03:23:26,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:23:26,766 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2023-02-16 03:23:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:23:26,768 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:26,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:26,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:26,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:26,997 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1568680158, now seen corresponding path program 1 times [2023-02-16 03:23:26,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:26,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788322140] [2023-02-16 03:23:26,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:26,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:27,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:27,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:27,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-16 03:23:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:27,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:23:27,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:23:27,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:23:27,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:27,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788322140] [2023-02-16 03:23:27,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788322140] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:23:27,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:23:27,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:23:27,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616623581] [2023-02-16 03:23:27,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:23:27,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:23:27,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:27,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:23:27,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:23:27,068 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:23:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:27,270 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2023-02-16 03:23:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:23:27,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-16 03:23:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:27,272 INFO L225 Difference]: With dead ends: 144 [2023-02-16 03:23:27,272 INFO L226 Difference]: Without dead ends: 142 [2023-02-16 03:23:27,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:23:27,273 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 60 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:27,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 247 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:23:27,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-16 03:23:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 75. [2023-02-16 03:23:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 36 states have (on average 2.0) internal successors, (72), 69 states have internal predecessors, (72), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:23:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2023-02-16 03:23:27,280 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 11 [2023-02-16 03:23:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:27,280 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2023-02-16 03:23:27,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:23:27,281 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2023-02-16 03:23:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:23:27,281 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:27,281 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:27,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:27,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:27,489 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:27,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash -27781040, now seen corresponding path program 1 times [2023-02-16 03:23:27,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:27,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705224599] [2023-02-16 03:23:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:27,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:27,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:27,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:27,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-16 03:23:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:27,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:23:27,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:27,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:23:27,679 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-16 03:23:27,704 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:23:27,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:23:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:23:27,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:23:27,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:27,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705224599] [2023-02-16 03:23:27,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705224599] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:23:27,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:27,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-16 03:23:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343926505] [2023-02-16 03:23:27,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:27,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:23:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:23:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-16 03:23:27,862 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 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-16 03:23:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:28,160 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2023-02-16 03:23:28,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:23:28,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 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 15 [2023-02-16 03:23:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:28,162 INFO L225 Difference]: With dead ends: 85 [2023-02-16 03:23:28,162 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 03:23:28,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2023-02-16 03:23:28,163 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 54 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:28,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 155 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 272 Invalid, 0 Unknown, 93 Unchecked, 0.3s Time] [2023-02-16 03:23:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 03:23:28,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2023-02-16 03:23:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 73 states have internal predecessors, (80), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-16 03:23:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2023-02-16 03:23:28,167 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 15 [2023-02-16 03:23:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:28,168 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2023-02-16 03:23:28,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 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-16 03:23:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2023-02-16 03:23:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:23:28,168 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:28,168 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:28,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:28,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:28,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:28,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:28,375 INFO L85 PathProgramCache]: Analyzing trace with hash -27781039, now seen corresponding path program 1 times [2023-02-16 03:23:28,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:28,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091439666] [2023-02-16 03:23:28,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:28,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:28,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:28,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:28,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-16 03:23:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:28,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 03:23:28,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:28,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:23:28,536 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|))) is different from true [2023-02-16 03:23:28,558 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:23:28,558 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 14 [2023-02-16 03:23:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:23:28,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:28,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:28,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091439666] [2023-02-16 03:23:28,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091439666] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:28,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1313851068] [2023-02-16 03:23:28,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:28,696 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:28,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:23:28,698 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:23:28,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-02-16 03:23:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:28,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:23:28,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:28,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:23:28,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:23:28,903 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_24 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_24))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:23:28,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:23:28,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:23:28,928 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:23:28,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:23:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:23:28,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:31,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1313851068] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:31,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:31,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-16 03:23:31,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162974841] [2023-02-16 03:23:31,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:31,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:23:31,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:31,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:23:31,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=172, Unknown=3, NotChecked=54, Total=272 [2023-02-16 03:23:31,283 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:23:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:31,888 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2023-02-16 03:23:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:23:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2023-02-16 03:23:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:31,890 INFO L225 Difference]: With dead ends: 150 [2023-02-16 03:23:31,890 INFO L226 Difference]: Without dead ends: 150 [2023-02-16 03:23:31,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=54, Invalid=223, Unknown=3, NotChecked=62, Total=342 [2023-02-16 03:23:31,891 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 107 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:31,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 313 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 579 Invalid, 0 Unknown, 308 Unchecked, 0.5s Time] [2023-02-16 03:23:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-16 03:23:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 109. [2023-02-16 03:23:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.8) internal successors, (126), 99 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-16 03:23:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2023-02-16 03:23:31,898 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 15 [2023-02-16 03:23:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:31,898 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2023-02-16 03:23:31,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:23:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2023-02-16 03:23:31,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:23:31,898 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:31,898 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:31,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:32,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:32,305 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:32,305 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:32,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:32,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1824732399, now seen corresponding path program 1 times [2023-02-16 03:23:32,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:32,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274680672] [2023-02-16 03:23:32,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:32,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:32,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:32,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:32,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-16 03:23:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:32,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:23:32,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:23:32,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:23:32,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:32,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274680672] [2023-02-16 03:23:32,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274680672] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:23:32,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:23:32,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:23:32,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905272626] [2023-02-16 03:23:32,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:23:32,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:23:32,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:32,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:23:32,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:23:32,387 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-16 03:23:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:32,421 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2023-02-16 03:23:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:23:32,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 15 [2023-02-16 03:23:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:32,422 INFO L225 Difference]: With dead ends: 71 [2023-02-16 03:23:32,422 INFO L226 Difference]: Without dead ends: 69 [2023-02-16 03:23:32,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:23:32,423 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:32,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:23:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-16 03:23:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-02-16 03:23:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 63 states have internal predecessors, (66), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 03:23:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2023-02-16 03:23:32,427 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 15 [2023-02-16 03:23:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:32,427 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2023-02-16 03:23:32,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-16 03:23:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2023-02-16 03:23:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:23:32,428 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:32,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:32,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:32,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:32,635 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:32,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1259761877, now seen corresponding path program 1 times [2023-02-16 03:23:32,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:32,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542136232] [2023-02-16 03:23:32,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:32,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:32,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:32,638 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:32,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-16 03:23:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:32,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:23:32,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:32,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:23:32,702 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 16 treesize of output 8 [2023-02-16 03:23:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:23:32,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:23:32,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:32,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542136232] [2023-02-16 03:23:32,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542136232] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:23:32,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:23:32,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:23:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191027739] [2023-02-16 03:23:32,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:23:32,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:23:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:32,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:23:32,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:23:32,710 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:23:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:32,800 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2023-02-16 03:23:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:23:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-02-16 03:23:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:32,801 INFO L225 Difference]: With dead ends: 78 [2023-02-16 03:23:32,801 INFO L226 Difference]: Without dead ends: 78 [2023-02-16 03:23:32,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:23:32,802 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:32,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 301 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:23:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-16 03:23:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2023-02-16 03:23:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 66 states have internal predecessors, (70), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 03:23:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2023-02-16 03:23:32,806 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 20 [2023-02-16 03:23:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:32,806 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2023-02-16 03:23:32,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:23:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2023-02-16 03:23:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:23:32,806 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:32,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:32,816 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-16 03:23:33,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:33,014 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:33,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1227750956, now seen corresponding path program 1 times [2023-02-16 03:23:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:33,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440811449] [2023-02-16 03:23:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:33,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:33,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:33,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:33,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-16 03:23:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:33,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:23:33,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:23:33,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:23:33,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:33,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440811449] [2023-02-16 03:23:33,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440811449] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:23:33,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:33,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-16 03:23:33,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758599722] [2023-02-16 03:23:33,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:33,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:23:33,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:33,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:23:33,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:23:33,333 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:23:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:33,488 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2023-02-16 03:23:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:23:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 20 [2023-02-16 03:23:33,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:33,489 INFO L225 Difference]: With dead ends: 76 [2023-02-16 03:23:33,489 INFO L226 Difference]: Without dead ends: 74 [2023-02-16 03:23:33,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:23:33,490 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 138 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:33,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 180 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:23:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-16 03:23:33,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-02-16 03:23:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 66 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 03:23:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2023-02-16 03:23:33,493 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 20 [2023-02-16 03:23:33,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:33,494 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2023-02-16 03:23:33,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:23:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2023-02-16 03:23:33,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:23:33,494 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:33,495 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:33,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:33,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:33,701 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash -12644306, now seen corresponding path program 1 times [2023-02-16 03:23:33,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:33,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008611035] [2023-02-16 03:23:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:33,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:33,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:33,704 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:33,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-16 03:23:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:33,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:23:33,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:33,845 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~a10~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1))))) is different from true [2023-02-16 03:23:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:23:33,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:33,927 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret44#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_18|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_18| (_ bv0 1))))) is different from false [2023-02-16 03:23:33,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:33,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008611035] [2023-02-16 03:23:33,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008611035] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:33,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [695786712] [2023-02-16 03:23:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:33,929 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:33,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:23:33,945 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:23:33,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-02-16 03:23:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:34,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:23:34,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:23:34,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:34,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret44#1.base_21| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_21| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_21|))))) is different from false [2023-02-16 03:23:34,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [695786712] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:34,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:34,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-02-16 03:23:34,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027807918] [2023-02-16 03:23:34,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:34,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:23:34,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:34,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:23:34,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=126, Unknown=3, NotChecked=72, Total=240 [2023-02-16 03:23:34,210 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:23:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:34,789 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2023-02-16 03:23:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:23:34,789 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2023-02-16 03:23:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:34,790 INFO L225 Difference]: With dead ends: 116 [2023-02-16 03:23:34,790 INFO L226 Difference]: Without dead ends: 111 [2023-02-16 03:23:34,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=276, Unknown=3, NotChecked=108, Total=462 [2023-02-16 03:23:34,791 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 140 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:34,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 348 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 498 Invalid, 1 Unknown, 113 Unchecked, 0.5s Time] [2023-02-16 03:23:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-16 03:23:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 67. [2023-02-16 03:23:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.55) internal successors, (62), 60 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 03:23:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2023-02-16 03:23:34,795 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 23 [2023-02-16 03:23:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:34,795 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2023-02-16 03:23:34,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:23:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2023-02-16 03:23:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:23:34,796 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:34,796 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:34,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:35,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:35,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:35,200 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:35,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:35,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1738347476, now seen corresponding path program 1 times [2023-02-16 03:23:35,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:35,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202919371] [2023-02-16 03:23:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:35,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:35,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:35,202 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:35,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-16 03:23:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:35,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:23:35,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:35,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:23:35,320 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-16 03:23:35,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-16 03:23:35,366 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-16 03:23:35,392 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:23:35,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:23:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-02-16 03:23:35,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:23:35,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:35,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202919371] [2023-02-16 03:23:35,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202919371] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:23:35,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:35,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2023-02-16 03:23:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67856167] [2023-02-16 03:23:35,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:35,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:23:35,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:35,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:23:35,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2023-02-16 03:23:35,519 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:23:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:35,743 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2023-02-16 03:23:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:23:35,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-16 03:23:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:35,744 INFO L225 Difference]: With dead ends: 75 [2023-02-16 03:23:35,745 INFO L226 Difference]: Without dead ends: 75 [2023-02-16 03:23:35,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=85, Unknown=1, NotChecked=18, Total=132 [2023-02-16 03:23:35,745 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 7 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:35,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 232 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 222 Invalid, 0 Unknown, 78 Unchecked, 0.2s Time] [2023-02-16 03:23:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-16 03:23:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2023-02-16 03:23:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.5) internal successors, (69), 65 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 03:23:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-02-16 03:23:35,748 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 25 [2023-02-16 03:23:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:35,748 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-02-16 03:23:35,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:23:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-02-16 03:23:35,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:23:35,748 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:35,748 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:35,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:35,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:35,955 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:35,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:35,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1738347475, now seen corresponding path program 1 times [2023-02-16 03:23:35,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:35,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556501784] [2023-02-16 03:23:35,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:35,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:35,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:35,957 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:35,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-16 03:23:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:36,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 03:23:36,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:36,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:23:36,057 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-16 03:23:36,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:23:36,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:23:36,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-16 03:23:36,133 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|))) is different from true [2023-02-16 03:23:36,145 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:23:36,145 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 14 [2023-02-16 03:23:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-16 03:23:36,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:36,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:36,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556501784] [2023-02-16 03:23:36,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556501784] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:36,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [744435871] [2023-02-16 03:23:36,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:36,320 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:36,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:23:36,321 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:23:36,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-02-16 03:23:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:36,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:23:36,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:36,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:23:36,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:23:36,535 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-16 03:23:36,541 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-16 03:23:36,606 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-16 03:23:36,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:23:36,688 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_133 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_133))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:23:36,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:23:36,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:23:36,708 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:23:36,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:23:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-16 03:23:36,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:37,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [744435871] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:37,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:37,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-16 03:23:37,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186737769] [2023-02-16 03:23:37,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:37,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-16 03:23:37,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:37,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-16 03:23:37,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=230, Unknown=2, NotChecked=62, Total=342 [2023-02-16 03:23:37,130 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 03:23:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:37,637 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2023-02-16 03:23:37,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:23:37,638 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2023-02-16 03:23:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:37,638 INFO L225 Difference]: With dead ends: 76 [2023-02-16 03:23:37,638 INFO L226 Difference]: Without dead ends: 76 [2023-02-16 03:23:37,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=387, Unknown=2, NotChecked=82, Total=552 [2023-02-16 03:23:37,639 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 10 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:37,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 437 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 412 Invalid, 0 Unknown, 158 Unchecked, 0.4s Time] [2023-02-16 03:23:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-16 03:23:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2023-02-16 03:23:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 65 states have internal predecessors, (68), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 03:23:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-02-16 03:23:37,641 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 25 [2023-02-16 03:23:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:37,641 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-02-16 03:23:37,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 03:23:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-02-16 03:23:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:23:37,642 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:37,642 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:37,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:37,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:38,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:38,045 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:38,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:38,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2051061195, now seen corresponding path program 1 times [2023-02-16 03:23:38,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:38,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796325583] [2023-02-16 03:23:38,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:38,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:38,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:38,047 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:38,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-16 03:23:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:38,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:23:38,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:38,141 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-16 03:23:38,145 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-16 03:23:38,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:23:38,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:23:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:23:38,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:23:38,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:38,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796325583] [2023-02-16 03:23:38,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796325583] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:23:38,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:23:38,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:23:38,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578766928] [2023-02-16 03:23:38,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:23:38,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:23:38,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:38,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:23:38,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:23:38,171 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:23:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:38,243 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2023-02-16 03:23:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:23:38,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-02-16 03:23:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:38,244 INFO L225 Difference]: With dead ends: 69 [2023-02-16 03:23:38,244 INFO L226 Difference]: Without dead ends: 65 [2023-02-16 03:23:38,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:23:38,244 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 2 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:38,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 295 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:23:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-16 03:23:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-02-16 03:23:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.5) internal successors, (60), 58 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:23:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2023-02-16 03:23:38,246 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 25 [2023-02-16 03:23:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:38,246 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2023-02-16 03:23:38,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:23:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2023-02-16 03:23:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:23:38,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:38,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:38,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:38,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:38,454 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:38,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:38,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1606003645, now seen corresponding path program 1 times [2023-02-16 03:23:38,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:38,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848742577] [2023-02-16 03:23:38,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:38,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:38,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:38,456 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:38,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-16 03:23:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:38,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 03:23:38,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:38,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:23:38,584 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:23:38,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:23:38,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:23:40,638 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_3|)))) is different from true [2023-02-16 03:23:40,690 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:23:40,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-16 03:23:40,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-16 03:23:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-16 03:23:40,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:40,754 INFO L321 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2023-02-16 03:23:40,754 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 23 treesize of output 22 [2023-02-16 03:23:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:23:40,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:40,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848742577] [2023-02-16 03:23:40,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848742577] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:23:40,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:40,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2023-02-16 03:23:40,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176698734] [2023-02-16 03:23:40,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:40,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 03:23:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:40,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 03:23:40,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=154, Unknown=1, NotChecked=24, Total=210 [2023-02-16 03:23:40,887 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:23:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:49,383 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2023-02-16 03:23:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 03:23:49,384 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-02-16 03:23:49,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:49,385 INFO L225 Difference]: With dead ends: 81 [2023-02-16 03:23:49,385 INFO L226 Difference]: Without dead ends: 81 [2023-02-16 03:23:49,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=93, Invalid=460, Unknown=3, NotChecked=44, Total=600 [2023-02-16 03:23:49,385 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 113 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:49,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 275 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 406 Invalid, 0 Unknown, 66 Unchecked, 0.3s Time] [2023-02-16 03:23:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-16 03:23:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2023-02-16 03:23:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 60 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:23:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2023-02-16 03:23:49,387 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 28 [2023-02-16 03:23:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:49,389 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2023-02-16 03:23:49,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:23:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2023-02-16 03:23:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:23:49,390 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:49,391 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:49,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-02-16 03:23:49,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:49,595 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:49,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1606003646, now seen corresponding path program 1 times [2023-02-16 03:23:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:49,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49926429] [2023-02-16 03:23:49,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:49,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:49,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:49,597 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:49,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-16 03:23:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:49,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:23:49,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:49,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:23:49,729 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:23:49,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:23:49,749 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-16 03:23:49,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:23:49,872 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:23:49,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-02-16 03:23:49,877 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 33 treesize of output 33 [2023-02-16 03:23:49,914 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 31 treesize of output 19 [2023-02-16 03:23:49,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-16 03:23:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:23:49,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:50,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:23:50,053 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 50 treesize of output 54 [2023-02-16 03:23:50,092 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_197) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv4 32)))) (forall ((v_ArrVal_198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_198) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) |c_ULTIMATE.start_entry_point_#t~mem47#1.base|))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_prenex_3) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_197 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_197) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv4 32)) (bvadd |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv4 32))))) is different from false [2023-02-16 03:23:50,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:50,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49926429] [2023-02-16 03:23:50,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49926429] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:50,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1368740544] [2023-02-16 03:23:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:50,110 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:50,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:23:50,111 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:23:50,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-02-16 03:23:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:50,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:23:50,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:50,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:23:50,250 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:23:50,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:23:50,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:23:50,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:23:50,352 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:23:50,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-02-16 03:23:50,356 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 33 treesize of output 33 [2023-02-16 03:23:50,371 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 31 treesize of output 19 [2023-02-16 03:23:50,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-16 03:23:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:23:50,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:50,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:23:50,429 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 50 treesize of output 54 [2023-02-16 03:23:50,465 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_222) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv4 32)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_223) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_prenex_5) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_222) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv4 32)) (bvadd |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv4 32))))) is different from false [2023-02-16 03:23:50,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1368740544] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:23:50,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:50,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2023-02-16 03:23:50,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41443224] [2023-02-16 03:23:50,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:50,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:23:50,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:50,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:23:50,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=178, Unknown=2, NotChecked=54, Total=272 [2023-02-16 03:23:50,485 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:23:52,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:23:55,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:23:57,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:23:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:57,530 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2023-02-16 03:23:57,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 03:23:57,531 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2023-02-16 03:23:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:57,533 INFO L225 Difference]: With dead ends: 95 [2023-02-16 03:23:57,533 INFO L226 Difference]: Without dead ends: 93 [2023-02-16 03:23:57,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=497, Unknown=2, NotChecked=94, Total=702 [2023-02-16 03:23:57,534 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 92 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:57,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 301 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 405 Invalid, 3 Unknown, 0 Unchecked, 6.8s Time] [2023-02-16 03:23:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-16 03:23:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 69. [2023-02-16 03:23:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 61 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:23:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2023-02-16 03:23:57,536 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 28 [2023-02-16 03:23:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:57,536 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2023-02-16 03:23:57,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:23:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2023-02-16 03:23:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:23:57,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:57,536 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:57,543 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-16 03:23:57,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:57,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:23:57,945 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:57,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:57,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1476244126, now seen corresponding path program 1 times [2023-02-16 03:23:57,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:57,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758659023] [2023-02-16 03:23:57,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:57,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:57,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:57,947 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:57,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-16 03:23:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:58,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:23:58,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:23:58,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:23:58,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:58,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758659023] [2023-02-16 03:23:58,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758659023] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:23:58,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:23:58,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:23:58,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364122911] [2023-02-16 03:23:58,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:23:58,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:23:58,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:58,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:23:58,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:23:58,042 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:23:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:58,134 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2023-02-16 03:23:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:23:58,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-02-16 03:23:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:58,135 INFO L225 Difference]: With dead ends: 68 [2023-02-16 03:23:58,135 INFO L226 Difference]: Without dead ends: 68 [2023-02-16 03:23:58,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:23:58,136 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 30 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:58,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 88 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:23:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-16 03:23:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-02-16 03:23:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 60 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:23:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2023-02-16 03:23:58,138 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 30 [2023-02-16 03:23:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:58,138 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2023-02-16 03:23:58,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:23:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2023-02-16 03:23:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:23:58,138 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:58,139 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:58,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 (19)] Forceful destruction successful, exit code 0 [2023-02-16 03:23:58,345 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-16 03:23:58,345 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1476244127, now seen corresponding path program 1 times [2023-02-16 03:23:58,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:58,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414524476] [2023-02-16 03:23:58,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:58,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:58,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:58,348 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-16 03:23:58,352 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-16 03:23:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:58,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:23:58,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:23:58,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:23:58,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-02-16 03:23:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:23:58,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:58,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414524476] [2023-02-16 03:23:58,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414524476] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:23:58,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:23:58,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-16 03:23:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746462574] [2023-02-16 03:23:58,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:23:58,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:23:58,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:58,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:23:58,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:23:58,726 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 03:23:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:59,059 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2023-02-16 03:23:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:23:59,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2023-02-16 03:23:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:59,062 INFO L225 Difference]: With dead ends: 67 [2023-02-16 03:23:59,062 INFO L226 Difference]: Without dead ends: 67 [2023-02-16 03:23:59,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:23:59,064 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 47 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:59,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 203 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:23:59,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-16 03:23:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-02-16 03:23:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 59 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:23:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-02-16 03:23:59,073 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 30 [2023-02-16 03:23:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:59,073 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-02-16 03:23:59,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 03:23:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-02-16 03:23:59,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:23:59,075 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:59,076 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:59,085 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-16 03:23:59,282 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-16 03:23:59,283 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:23:59,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:23:59,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1481073420, now seen corresponding path program 1 times [2023-02-16 03:23:59,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:23:59,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997159900] [2023-02-16 03:23:59,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:23:59,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:23:59,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:23:59,286 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:23:59,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-16 03:23:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:23:59,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 03:23:59,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:23:59,445 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-16 03:23:59,449 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-16 03:23:59,485 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-16 03:23:59,598 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:23:59,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2023-02-16 03:23:59,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:23:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:23:59,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:23:59,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:23:59,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997159900] [2023-02-16 03:23:59,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997159900] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:23:59,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:23:59,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 03:23:59,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951506109] [2023-02-16 03:23:59,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:23:59,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:23:59,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:23:59,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:23:59,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:23:59,657 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:23:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:23:59,901 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2023-02-16 03:23:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:23:59,902 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2023-02-16 03:23:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:23:59,902 INFO L225 Difference]: With dead ends: 79 [2023-02-16 03:23:59,902 INFO L226 Difference]: Without dead ends: 79 [2023-02-16 03:23:59,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:23:59,903 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 97 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:23:59,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 234 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:23:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-16 03:23:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2023-02-16 03:23:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 60 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:23:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2023-02-16 03:23:59,905 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 31 [2023-02-16 03:23:59,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:23:59,905 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2023-02-16 03:23:59,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:23:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2023-02-16 03:23:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:23:59,906 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:23:59,906 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:23:59,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:00,106 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-16 03:24:00,107 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:24:00,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:00,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1481072329, now seen corresponding path program 1 times [2023-02-16 03:24:00,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:00,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3904665] [2023-02-16 03:24:00,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:00,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:00,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:00,109 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-16 03:24:00,111 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-16 03:24:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:00,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:24:00,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:00,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-16 03:24:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:24:00,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:00,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:00,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3904665] [2023-02-16 03:24:00,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3904665] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:00,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:00,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:00,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502658588] [2023-02-16 03:24:00,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:00,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:24:00,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:00,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:24:00,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:24:00,227 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:00,377 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2023-02-16 03:24:00,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:24:00,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-16 03:24:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:00,378 INFO L225 Difference]: With dead ends: 71 [2023-02-16 03:24:00,378 INFO L226 Difference]: Without dead ends: 71 [2023-02-16 03:24:00,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:24:00,379 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 16 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:00,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 166 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:24:00,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-16 03:24:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2023-02-16 03:24:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 59 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:24:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-02-16 03:24:00,381 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 31 [2023-02-16 03:24:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:00,381 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-02-16 03:24:00,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-02-16 03:24:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:24:00,381 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:00,381 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:00,392 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-16 03:24:00,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:00,592 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:24:00,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:00,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1481072328, now seen corresponding path program 1 times [2023-02-16 03:24:00,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:00,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636497226] [2023-02-16 03:24:00,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:00,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:00,595 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:24:00,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-16 03:24:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:00,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 03:24:00,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:00,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-16 03:24:00,800 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 32 treesize of output 16 [2023-02-16 03:24:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:24:00,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:00,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:00,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636497226] [2023-02-16 03:24:00,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636497226] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:00,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:00,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:00,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138395120] [2023-02-16 03:24:00,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:00,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:24:00,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:00,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:24:00,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:24:00,856 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:01,347 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2023-02-16 03:24:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:24:01,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-16 03:24:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:01,348 INFO L225 Difference]: With dead ends: 77 [2023-02-16 03:24:01,348 INFO L226 Difference]: Without dead ends: 77 [2023-02-16 03:24:01,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:24:01,349 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 20 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 181 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.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:01,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 181 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:24:01,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-16 03:24:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2023-02-16 03:24:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 58 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:24:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-02-16 03:24:01,351 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 31 [2023-02-16 03:24:01,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:01,351 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-02-16 03:24:01,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:01,351 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-02-16 03:24:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 03:24:01,351 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:01,351 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:01,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:01,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:01,557 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:24:01,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:01,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1331364346, now seen corresponding path program 1 times [2023-02-16 03:24:01,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:01,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263657728] [2023-02-16 03:24:01,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:01,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:01,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:01,559 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:24:01,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 (24)] Waiting until timeout for monitored process [2023-02-16 03:24:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:01,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:24:01,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:01,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:24:01,676 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:01,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:24:01,690 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 6 treesize of output 5 [2023-02-16 03:24:01,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:24:03,738 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_13| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_21| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_21| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_21|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_13|)))) is different from true [2023-02-16 03:24:05,830 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:24:05,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2023-02-16 03:24:05,834 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 27 treesize of output 29 [2023-02-16 03:24:05,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-02-16 03:24:05,911 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:24:05,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2023-02-16 03:24:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:24:05,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:06,918 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret48#1.base_26| (_ BitVec 32))) (or (= (_ bv0 32) |v_ULTIMATE.start_entry_point_#t~ret48#1.base_26|) (forall ((v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |v_ULTIMATE.start_entry_point_#t~ret48#1.base_26|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_342) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))))))) is different from false [2023-02-16 03:24:06,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:06,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263657728] [2023-02-16 03:24:06,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263657728] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:06,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1454160010] [2023-02-16 03:24:06,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:06,920 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:06,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:06,921 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:24:06,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-02-16 03:24:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:07,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 03:24:07,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:07,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:24:07,094 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:07,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:24:07,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:24:07,353 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:24:07,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-02-16 03:24:07,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-16 03:24:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:24:07,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:07,473 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_366) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2023-02-16 03:24:07,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1454160010] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:07,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:07,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2023-02-16 03:24:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254985055] [2023-02-16 03:24:07,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:07,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 03:24:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:07,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 03:24:07,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=534, Unknown=9, NotChecked=144, Total=756 [2023-02-16 03:24:07,481 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-16 03:24:09,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:24:11,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:24:14,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:24:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:14,997 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2023-02-16 03:24:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 03:24:14,998 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 32 [2023-02-16 03:24:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:14,999 INFO L225 Difference]: With dead ends: 96 [2023-02-16 03:24:14,999 INFO L226 Difference]: Without dead ends: 96 [2023-02-16 03:24:14,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=200, Invalid=1285, Unknown=9, NotChecked=228, Total=1722 [2023-02-16 03:24:14,999 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 77 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:15,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 471 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 707 Invalid, 3 Unknown, 80 Unchecked, 7.1s Time] [2023-02-16 03:24:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-16 03:24:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2023-02-16 03:24:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 63 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:24:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2023-02-16 03:24:15,002 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 32 [2023-02-16 03:24:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:15,002 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2023-02-16 03:24:15,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-16 03:24:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2023-02-16 03:24:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:24:15,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:15,002 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-02-16 03:24:15,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:15,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:15,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:15,410 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:24:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1548295403, now seen corresponding path program 1 times [2023-02-16 03:24:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:15,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695802507] [2023-02-16 03:24:15,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:15,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:15,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:15,413 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:24:15,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-16 03:24:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:15,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:24:15,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:15,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-16 03:24:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:24:15,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:15,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:15,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695802507] [2023-02-16 03:24:15,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695802507] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:15,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:15,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:24:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127675432] [2023-02-16 03:24:15,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:15,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:24:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:15,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:24:15,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:24:15,524 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:15,643 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2023-02-16 03:24:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:24:15,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2023-02-16 03:24:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:15,644 INFO L225 Difference]: With dead ends: 73 [2023-02-16 03:24:15,644 INFO L226 Difference]: Without dead ends: 73 [2023-02-16 03:24:15,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:24:15,644 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:15,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:24:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-16 03:24:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-16 03:24:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 64 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:24:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2023-02-16 03:24:15,646 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 33 [2023-02-16 03:24:15,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:15,646 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2023-02-16 03:24:15,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:24:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2023-02-16 03:24:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:24:15,647 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:15,647 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:15,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 (26)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:15,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:15,849 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:24:15,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:15,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1617154909, now seen corresponding path program 1 times [2023-02-16 03:24:15,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:15,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272965401] [2023-02-16 03:24:15,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:15,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:15,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:15,851 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:24:15,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-16 03:24:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:15,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-16 03:24:15,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:15,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:24:16,002 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:16,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:24:16,014 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 6 treesize of output 5 [2023-02-16 03:24:16,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:24:18,064 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_25| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_25| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_25|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_15|)))) is different from true [2023-02-16 03:24:18,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:24:22,168 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:24:22,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2023-02-16 03:24:22,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-16 03:24:22,235 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-16 03:24:22,271 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:24:22,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-02-16 03:24:22,296 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_411 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_411))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:24:22,311 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:24:22,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:24:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2023-02-16 03:24:22,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:22,590 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |c_ULTIMATE.start_entry_point_#t~ret48#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_409) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (_ bv1 1)))) is different from false [2023-02-16 03:24:22,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 76 [2023-02-16 03:24:22,616 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret48#1.base_32| (_ BitVec 32)) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |v_ULTIMATE.start_entry_point_#t~ret48#1.base_32|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_409) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) |v_ULTIMATE.start_entry_point_#t~ret48#1.base_32|)) is different from false [2023-02-16 03:24:22,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:22,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272965401] [2023-02-16 03:24:22,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272965401] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:22,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [58695844] [2023-02-16 03:24:22,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:22,618 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:22,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:22,619 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:24:22,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-02-16 03:24:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:22,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-16 03:24:22,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:22,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:24:24,943 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:24,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:24:24,973 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-16 03:24:24,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:24:27,063 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_27| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_27| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_27|) (_ bv0 32))))) is different from true [2023-02-16 03:24:27,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:24:35,226 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:24:35,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2023-02-16 03:24:35,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-16 03:24:35,353 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-16 03:24:35,423 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:24:35,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-02-16 03:24:35,434 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_445 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_445))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:24:35,451 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:24:35,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:24:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2023-02-16 03:24:35,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:35,596 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |c_ULTIMATE.start_entry_point_#t~ret48#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_443) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (_ bv1 1)))) is different from false [2023-02-16 03:24:35,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 76 [2023-02-16 03:24:35,622 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_entry_point_#t~ret48#1.base_35| (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |v_ULTIMATE.start_entry_point_#t~ret48#1.base_35|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_443) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) |v_ULTIMATE.start_entry_point_#t~ret48#1.base_35|)) is different from false [2023-02-16 03:24:35,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [58695844] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:35,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:35,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2023-02-16 03:24:35,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260056084] [2023-02-16 03:24:35,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:35,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 03:24:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:35,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 03:24:35,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=842, Unknown=13, NotChecked=520, Total=1482 [2023-02-16 03:24:35,625 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 31 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 03:24:37,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:24:39,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:24:45,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:24:47,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:01,392 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-02-16 03:25:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 03:25:01,393 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 37 [2023-02-16 03:25:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:01,393 INFO L225 Difference]: With dead ends: 85 [2023-02-16 03:25:01,393 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 03:25:01,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=254, Invalid=1741, Unknown=17, NotChecked=744, Total=2756 [2023-02-16 03:25:01,395 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 141 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 50 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:01,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 388 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 656 Invalid, 4 Unknown, 301 Unchecked, 9.2s Time] [2023-02-16 03:25:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 03:25:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2023-02-16 03:25:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.290909090909091) internal successors, (71), 67 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:25:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2023-02-16 03:25:01,398 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 37 [2023-02-16 03:25:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:01,398 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2023-02-16 03:25:01,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 03:25:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2023-02-16 03:25:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:25:01,398 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:01,399 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:25:01,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:01,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:01,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:25:01,802 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:25:01,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:01,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1617154908, now seen corresponding path program 1 times [2023-02-16 03:25:01,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:01,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208698980] [2023-02-16 03:25:01,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:01,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:25:01,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:01,805 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:25:01,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-16 03:25:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:01,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-16 03:25:01,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:01,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:25:02,002 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:25:02,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:25:02,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:25:02,023 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 6 treesize of output 5 [2023-02-16 03:25:04,077 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_29| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_29| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_29|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_18|)))) is different from true [2023-02-16 03:25:06,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:25:08,227 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:25:08,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-02-16 03:25:08,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-02-16 03:25:08,385 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-16 03:25:08,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 38 [2023-02-16 03:25:08,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2023-02-16 03:25:10,489 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|))) is different from true [2023-02-16 03:25:10,501 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:25:10,501 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 14 [2023-02-16 03:25:10,529 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 8 not checked. [2023-02-16 03:25:10,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:10,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:10,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208698980] [2023-02-16 03:25:10,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208698980] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:10,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1091998110] [2023-02-16 03:25:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:10,818 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:25:10,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:25:10,819 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:25:10,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-02-16 03:25:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:11,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-16 03:25:11,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:11,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:25:11,145 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:25:11,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:25:11,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:25:11,194 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-16 03:25:11,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:25:11,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:25:11,776 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:25:11,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-02-16 03:25:11,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 53 [2023-02-16 03:25:12,088 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-16 03:25:12,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 44 [2023-02-16 03:25:12,098 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:25:12,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-16 03:25:12,217 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_512 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_512))))) is different from true [2023-02-16 03:25:12,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:25:12,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:25:12,233 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:25:12,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:25:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-16 03:25:12,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:16,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1091998110] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:16,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:16,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2023-02-16 03:25:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012712968] [2023-02-16 03:25:16,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:16,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 03:25:16,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:16,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 03:25:16,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1288, Unknown=6, NotChecked=222, Total=1640 [2023-02-16 03:25:16,947 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 38 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 29 states have internal predecessors, (53), 7 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:25:18,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:23,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:25,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:27,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:29,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:33,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:35,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:37,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:43,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:25:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:43,260 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2023-02-16 03:25:43,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 03:25:43,262 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 29 states have internal predecessors, (53), 7 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2023-02-16 03:25:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:43,262 INFO L225 Difference]: With dead ends: 102 [2023-02-16 03:25:43,262 INFO L226 Difference]: Without dead ends: 102 [2023-02-16 03:25:43,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=286, Invalid=2474, Unknown=8, NotChecked=312, Total=3080 [2023-02-16 03:25:43,264 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 112 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 42 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:43,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 668 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 940 Invalid, 9 Unknown, 279 Unchecked, 19.4s Time] [2023-02-16 03:25:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-16 03:25:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 77. [2023-02-16 03:25:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 67 states have internal predecessors, (70), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:25:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-16 03:25:43,266 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 37 [2023-02-16 03:25:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:43,266 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-16 03:25:43,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 29 states have internal predecessors, (53), 7 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 03:25:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-16 03:25:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:25:43,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:43,266 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-02-16 03:25:43,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:43,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:43,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:25:43,673 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:25:43,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1614444768, now seen corresponding path program 1 times [2023-02-16 03:25:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:43,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091151154] [2023-02-16 03:25:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:43,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:25:43,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:43,675 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:25:43,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-16 03:25:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:43,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 03:25:43,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:43,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:25:43,971 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2023-02-16 03:25:43,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2023-02-16 03:25:43,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-16 03:25:44,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:25:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:25:44,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:44,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:25:44,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2023-02-16 03:25:44,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-02-16 03:25:44,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-02-16 03:25:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:25:44,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:44,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091151154] [2023-02-16 03:25:44,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091151154] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:25:44,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:44,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2023-02-16 03:25:44,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582595542] [2023-02-16 03:25:44,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:44,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 03:25:44,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:44,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 03:25:44,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-02-16 03:25:44,517 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 03:25:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:45,120 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2023-02-16 03:25:45,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:25:45,120 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2023-02-16 03:25:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:45,121 INFO L225 Difference]: With dead ends: 80 [2023-02-16 03:25:45,121 INFO L226 Difference]: Without dead ends: 80 [2023-02-16 03:25:45,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2023-02-16 03:25:45,121 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 84 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:45,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 284 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:25:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-16 03:25:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-16 03:25:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 70 states have internal predecessors, (73), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:25:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-02-16 03:25:45,124 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 36 [2023-02-16 03:25:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:45,124 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-02-16 03:25:45,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 03:25:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-02-16 03:25:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:25:45,124 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:45,124 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:25:45,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:45,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:25:45,325 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:25:45,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2127689086, now seen corresponding path program 1 times [2023-02-16 03:25:45,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:45,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863303666] [2023-02-16 03:25:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:45,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:25:45,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:45,326 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:25:45,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-16 03:25:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:45,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-16 03:25:45,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:45,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:25:45,470 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:25:45,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:25:45,483 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 6 treesize of output 5 [2023-02-16 03:25:45,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:25:47,553 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_25| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_37| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_37|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_25|)))) is different from true [2023-02-16 03:25:49,657 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:25:49,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-02-16 03:25:49,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-02-16 03:25:49,755 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-16 03:25:49,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2023-02-16 03:25:49,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2023-02-16 03:25:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:25:49,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:52,125 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_#t~mem47#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_26| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16|)) (.cse6 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16|))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16| (store .cse6 |v_ULTIMATE.start_entry_point_#t~mem47#1.offset_BEFORE_CALL_12| (_ bv0 32)))) (.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16| (store .cse5 |v_ULTIMATE.start_entry_point_#t~mem47#1.offset_BEFORE_CALL_12| (_ bv0 32))))) (let ((.cse1 (select (select .cse0 |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_38|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_26|)) (.cse2 (select (select .cse3 |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_38|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_26|))) (or (not (= (select (select .cse0 .cse1) .cse2) (_ bv0 32))) (not (= (select (select .cse3 .cse1) .cse2) (_ bv0 32))) (= (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16| (store .cse6 |v_ULTIMATE.start_entry_point_#t~mem47#1.offset_BEFORE_CALL_12| |c_ldv_malloc_#res.offset|)))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16| (store .cse5 |v_ULTIMATE.start_entry_point_#t~mem47#1.offset_BEFORE_CALL_12| |c_ldv_malloc_#res.base|)) |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_38|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_26|)) (select (select .cse4 |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_38|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_26|))) (_ bv0 32))))))) (forall ((|v_ULTIMATE.start_entry_point_#t~mem47#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_26| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (let ((.cse12 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16|)) (.cse13 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16|))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16| (store .cse13 |v_ULTIMATE.start_entry_point_#t~mem47#1.offset_BEFORE_CALL_12| (_ bv0 32)))) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16| (store .cse12 |v_ULTIMATE.start_entry_point_#t~mem47#1.offset_BEFORE_CALL_12| (_ bv0 32))))) (let ((.cse8 (select (select .cse7 |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_38|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_26|)) (.cse9 (select (select .cse10 |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_38|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_26|))) (or (not (= (select (select .cse7 .cse8) .cse9) (_ bv0 32))) (not (= (select (select .cse10 .cse8) .cse9) (_ bv0 32))) (= (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16| (store .cse12 |v_ULTIMATE.start_entry_point_#t~mem47#1.offset_BEFORE_CALL_12| |c_ldv_malloc_#res.base|)))) (select .cse11 (select (select .cse11 |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_38|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_26|))) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_16| (store .cse13 |v_ULTIMATE.start_entry_point_#t~mem47#1.offset_BEFORE_CALL_12| |c_ldv_malloc_#res.offset|)) |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_38|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_26|)) (_ bv0 32)))))))) is different from false [2023-02-16 03:25:52,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:25:52,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1150 treesize of output 1048 [2023-02-16 03:25:52,481 INFO L321 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-02-16 03:25:52,481 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 882 treesize of output 744 [2023-02-16 03:25:52,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:25:52,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:25:52,670 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-16 03:25:52,671 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 388 treesize of output 392 [2023-02-16 03:25:52,921 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:25:52,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 393 treesize of output 345 [2023-02-16 03:25:52,927 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:25:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2023-02-16 03:25:53,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:53,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863303666] [2023-02-16 03:25:53,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863303666] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:25:53,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:53,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2023-02-16 03:25:53,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25619324] [2023-02-16 03:25:53,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:53,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 03:25:53,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:53,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 03:25:53,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=367, Unknown=2, NotChecked=78, Total=506 [2023-02-16 03:25:53,092 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:26:14,910 WARN L233 SmtUtils]: Spent 17.20s on a formula simplification. DAG size of input: 58 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:26:18,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:38,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-16 03:26:42,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:26:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:46,201 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2023-02-16 03:26:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 03:26:46,202 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2023-02-16 03:26:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:46,203 INFO L225 Difference]: With dead ends: 79 [2023-02-16 03:26:46,203 INFO L226 Difference]: Without dead ends: 79 [2023-02-16 03:26:46,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 46.9s TimeCoverageRelationStatistics Valid=162, Invalid=958, Unknown=10, NotChecked=130, Total=1260 [2023-02-16 03:26:46,204 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 85 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:46,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 370 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 554 Invalid, 3 Unknown, 126 Unchecked, 12.9s Time] [2023-02-16 03:26:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-16 03:26:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2023-02-16 03:26:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 65 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-16 03:26:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2023-02-16 03:26:46,205 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 37 [2023-02-16 03:26:46,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:46,206 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2023-02-16 03:26:46,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:26:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2023-02-16 03:26:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:26:46,206 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:46,206 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-02-16 03:26:46,213 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 (32)] Ended with exit code 0 [2023-02-16 03:26:46,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:26:46,410 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:26:46,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:46,410 INFO L85 PathProgramCache]: Analyzing trace with hash -998224317, now seen corresponding path program 1 times [2023-02-16 03:26:46,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:46,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809549073] [2023-02-16 03:26:46,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:46,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:26:46,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:46,412 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:26:46,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-02-16 03:26:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:46,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-16 03:26:46,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:46,906 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-16 03:26:47,210 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-16 03:26:47,211 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 23 treesize of output 15 [2023-02-16 03:26:51,468 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:26:51,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-16 03:26:51,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-16 03:26:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:26:54,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:26:54,361 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_587) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 1)) |c_ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1)))) is different from false [2023-02-16 03:26:54,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:26:54,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809549073] [2023-02-16 03:26:54,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809549073] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:26:54,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [28096263] [2023-02-16 03:26:54,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:54,404 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:26:54,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:26:54,433 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:26:54,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-02-16 03:26:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:54,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 03:26:54,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:59,403 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-16 03:26:59,901 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-02-16 03:26:59,902 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 28 treesize of output 18 [2023-02-16 03:27:02,194 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:27:02,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-16 03:27:02,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-16 03:27:04,848 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((|v_ULTIMATE.start_entry_point_#t~mem53#1.base_14| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~a10~0#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv1 1)))) (and (= |c_#valid| (store (store .cse0 |v_ULTIMATE.start_entry_point_#t~mem53#1.base_14| (_ bv0 1)) |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_entry_point_#t~mem53#1.base_14|)))))) is different from true [2023-02-16 03:27:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:04,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:04,974 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_612) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 1)) |c_ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1)))) is different from false [2023-02-16 03:27:05,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [28096263] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:05,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:05,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2023-02-16 03:27:05,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714385887] [2023-02-16 03:27:05,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:05,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 03:27:05,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:05,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 03:27:05,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=621, Unknown=8, NotChecked=156, Total=870 [2023-02-16 03:27:05,020 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 25 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:27:07,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:27:09,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:27:13,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:27:15,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:27:27,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:27:29,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:27:37,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:27:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:42,635 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2023-02-16 03:27:42,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 03:27:42,636 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-02-16 03:27:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:42,636 INFO L225 Difference]: With dead ends: 78 [2023-02-16 03:27:42,636 INFO L226 Difference]: Without dead ends: 62 [2023-02-16 03:27:42,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=187, Invalid=1451, Unknown=14, NotChecked=240, Total=1892 [2023-02-16 03:27:42,637 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 66 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 24 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:42,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 239 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 470 Invalid, 10 Unknown, 67 Unchecked, 16.0s Time] [2023-02-16 03:27:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-16 03:27:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2023-02-16 03:27:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 52 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:27:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2023-02-16 03:27:42,639 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 38 [2023-02-16 03:27:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:42,639 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2023-02-16 03:27:42,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:27:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2023-02-16 03:27:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:27:42,639 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:42,639 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:42,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-02-16 03:27:42,849 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 (33)] Ended with exit code 0 [2023-02-16 03:27:43,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:43,049 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-16 03:27:43,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:43,049 INFO L85 PathProgramCache]: Analyzing trace with hash -424914424, now seen corresponding path program 1 times [2023-02-16 03:27:43,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:43,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769435223] [2023-02-16 03:27:43,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:43,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:43,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:43,051 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:43,053 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 (35)] Waiting until timeout for monitored process [2023-02-16 03:27:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:43,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-16 03:27:43,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:43,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:27:43,353 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:43,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:27:43,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:27:43,416 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 6 treesize of output 5 [2023-02-16 03:27:43,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-16 03:27:49,949 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:49,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:27:50,216 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 03:27:50,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 39 [2023-02-16 03:27:50,234 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 27 treesize of output 29 [2023-02-16 03:27:50,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-02-16 03:27:51,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-16 03:27:57,211 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_alloc_10_#t~mem38#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_30| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_46| (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_46|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_30|))) (and (not (= (select (select |c_#memory_$Pointer$.base| .cse0) |ULTIMATE.start_alloc_10_#t~mem38#1.offset|) |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_46|)) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_46| .cse0))))) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))) is different from true [2023-02-16 03:27:57,366 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-16 03:27:57,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 36 [2023-02-16 03:27:57,607 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:27:57,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2023-02-16 03:27:57,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-16 03:27:57,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-16 03:27:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-16 03:27:57,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:58,066 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_650 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_alloc_10_#t~mem39#1.base| v_ArrVal_650) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) (_ bv1 1)))) is different from false [2023-02-16 03:27:58,136 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_156| (_ BitVec 32)) (v_ArrVal_650 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ldv_malloc_#res.base_156| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_alloc_10_#t~mem39#1.base| v_ArrVal_650) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) (_ bv1 1)))) is different from false [2023-02-16 03:27:58,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:58,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769435223] [2023-02-16 03:27:58,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769435223] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:58,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1042405994] [2023-02-16 03:27:58,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:58,140 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:58,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:58,141 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:27:58,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2023-02-16 03:27:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:58,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-16 03:27:58,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:58,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:27:58,764 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:58,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:27:58,892 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-16 03:27:58,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:27:59,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5