./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test12-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_test12-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 28b4a2248017400eafcc33919e1388faa83abd48459a3d9191abc0a1d3b17a56 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:24:02,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:24:02,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:24:02,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:24:02,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:24:02,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:24:02,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:24:02,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:24:02,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:24:02,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:24:02,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:24:02,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:24:02,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:24:02,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:24:02,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:24:02,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:24:02,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:24:02,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:24:02,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:24:02,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:24:02,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:24:02,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:24:02,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:24:02,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:24:02,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:24:02,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:24:02,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:24:02,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:24:02,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:24:02,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:24:02,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:24:02,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:24:02,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:24:02,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:24:02,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:24:02,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:24:02,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:24:02,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:24:02,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:24:02,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:24:02,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:24:02,134 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:24:02,158 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:24:02,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:24:02,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:24:02,159 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:24:02,160 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:24:02,160 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:24:02,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:24:02,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:24:02,160 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:24:02,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:24:02,161 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:24:02,161 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:24:02,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:24:02,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:24:02,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:24:02,162 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:24:02,162 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:24:02,162 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:24:02,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:24:02,162 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:24:02,163 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:24:02,163 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:24:02,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:24:02,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:24:02,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:24:02,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:24:02,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:24:02,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:24:02,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:24:02,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:24:02,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:24:02,164 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:24:02,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:24:02,165 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:24:02,165 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 -> 28b4a2248017400eafcc33919e1388faa83abd48459a3d9191abc0a1d3b17a56 [2023-02-16 03:24:02,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:24:02,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:24:02,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:24:02,398 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:24:02,398 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:24:02,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test12-1.i [2023-02-16 03:24:03,506 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:24:03,719 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:24:03,720 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-1.i [2023-02-16 03:24:03,731 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a58afadf/4b992b084cb940c6951abdf1d0dcb554/FLAG522ccfba7 [2023-02-16 03:24:03,745 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a58afadf/4b992b084cb940c6951abdf1d0dcb554 [2023-02-16 03:24:03,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:24:03,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:24:03,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:24:03,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:24:03,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:24:03,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:24:03" (1/1) ... [2023-02-16 03:24:03,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441c9931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:03, skipping insertion in model container [2023-02-16 03:24:03,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:24:03" (1/1) ... [2023-02-16 03:24:03,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:24:03,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:24:04,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:24:04,063 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:24:04,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3653f604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:04, skipping insertion in model container [2023-02-16 03:24:04,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:24:04,065 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-16 03:24:04,067 INFO L158 Benchmark]: Toolchain (without parser) took 318.24ms. Allocated memory is still 151.0MB. Free memory was 120.5MB in the beginning and 105.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 03:24:04,068 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:24:04,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.72ms. Allocated memory is still 151.0MB. Free memory was 120.2MB in the beginning and 105.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 03:24:04,070 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.17ms. Allocated memory is still 125.8MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.72ms. Allocated memory is still 151.0MB. Free memory was 120.2MB in the beginning and 105.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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_test12-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 28b4a2248017400eafcc33919e1388faa83abd48459a3d9191abc0a1d3b17a56 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:24:05,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:24:05,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:24:05,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:24:05,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:24:05,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:24:05,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:24:05,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:24:05,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:24:05,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:24:05,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:24:05,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:24:05,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:24:05,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:24:05,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:24:05,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:24:05,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:24:05,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:24:05,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:24:05,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:24:05,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:24:05,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:24:05,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:24:05,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:24:05,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:24:05,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:24:05,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:24:05,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:24:05,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:24:05,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:24:05,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:24:05,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:24:05,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:24:05,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:24:05,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:24:05,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:24:05,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:24:05,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:24:05,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:24:05,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:24:05,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:24:05,642 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:24:05,663 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:24:05,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:24:05,663 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:24:05,663 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:24:05,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:24:05,664 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:24:05,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:24:05,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:24:05,665 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:24:05,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:24:05,665 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:24:05,665 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:24:05,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:24:05,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:24:05,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:24:05,666 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:24:05,666 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:24:05,666 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:24:05,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:24:05,667 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:24:05,667 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:24:05,667 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:24:05,667 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:24:05,667 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:24:05,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:24:05,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:24:05,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:24:05,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:24:05,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:24:05,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:24:05,677 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:24:05,677 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:05,677 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:24:05,677 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:24:05,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:24:05,677 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:24:05,677 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:24:05,678 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 -> 28b4a2248017400eafcc33919e1388faa83abd48459a3d9191abc0a1d3b17a56 [2023-02-16 03:24:05,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:24:05,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:24:05,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:24:05,918 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:24:05,918 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:24:05,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test12-1.i [2023-02-16 03:24:07,030 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:24:07,319 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:24:07,319 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-1.i [2023-02-16 03:24:07,353 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebef6cc0/74a1ae73b37746d186b5c13febf5e4d5/FLAG20d3daeb8 [2023-02-16 03:24:07,377 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebef6cc0/74a1ae73b37746d186b5c13febf5e4d5 [2023-02-16 03:24:07,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:24:07,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:24:07,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:24:07,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:24:07,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:24:07,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:24:07" (1/1) ... [2023-02-16 03:24:07,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158af897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:07, skipping insertion in model container [2023-02-16 03:24:07,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:24:07" (1/1) ... [2023-02-16 03:24:07,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:24:07,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:24:07,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:24:07,924 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-16 03:24:07,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:24:07,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:24:08,010 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:24:08,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:24:08,106 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:24:08,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:08 WrapperNode [2023-02-16 03:24:08,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:24:08,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:24:08,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:24:08,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:24:08,113 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:24:08" (1/1) ... [2023-02-16 03:24:08,144 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:24:08" (1/1) ... [2023-02-16 03:24:08,182 INFO L138 Inliner]: procedures = 179, calls = 145, calls flagged for inlining = 33, calls inlined = 20, statements flattened = 331 [2023-02-16 03:24:08,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:24:08,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:24:08,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:24:08,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:24:08,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:08" (1/1) ... [2023-02-16 03:24:08,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:08" (1/1) ... [2023-02-16 03:24:08,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:08" (1/1) ... [2023-02-16 03:24:08,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:08" (1/1) ... [2023-02-16 03:24:08,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:08" (1/1) ... [2023-02-16 03:24:08,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:08" (1/1) ... [2023-02-16 03:24:08,246 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:08" (1/1) ... [2023-02-16 03:24:08,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:08" (1/1) ... [2023-02-16 03:24:08,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:24:08,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:24:08,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:24:08,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:24:08,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:08" (1/1) ... [2023-02-16 03:24:08,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:24:08,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:24:08,286 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:24:08,317 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:24:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-02-16 03:24:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-16 03:24:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-02-16 03:24:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-02-16 03:24:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-02-16 03:24:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-02-16 03:24:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2023-02-16 03:24:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2023-02-16 03:24:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-16 03:24:08,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-16 03:24:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-16 03:24:08,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-16 03:24:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2023-02-16 03:24:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-02-16 03:24:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:24:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:24:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2023-02-16 03:24:08,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2023-02-16 03:24:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 03:24:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:24:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2023-02-16 03:24:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:24:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-02-16 03:24:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:24:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 03:24:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-02-16 03:24:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2023-02-16 03:24:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:24:08,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:24:08,560 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:24:08,562 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:24:08,565 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-02-16 03:24:09,434 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:24:09,440 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:24:09,440 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 03:24:09,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:24:09 BoogieIcfgContainer [2023-02-16 03:24:09,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:24:09,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:24:09,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:24:09,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:24:09,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:24:07" (1/3) ... [2023-02-16 03:24:09,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198d8d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:24:09, skipping insertion in model container [2023-02-16 03:24:09,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:24:08" (2/3) ... [2023-02-16 03:24:09,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198d8d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:24:09, skipping insertion in model container [2023-02-16 03:24:09,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:24:09" (3/3) ... [2023-02-16 03:24:09,451 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test12-1.i [2023-02-16 03:24:09,463 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:24:09,464 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 124 error locations. [2023-02-16 03:24:09,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:24:09,502 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;@10bea3c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:24:09,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 124 error locations. [2023-02-16 03:24:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 171 states have (on average 1.8654970760233918) internal successors, (319), 294 states have internal predecessors, (319), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-16 03:24:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:24:09,512 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:09,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:09,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash -297378988, now seen corresponding path program 1 times [2023-02-16 03:24:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:09,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911289432] [2023-02-16 03:24:09,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:09,525 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:09,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:09,528 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:24:09,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-16 03:24:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:09,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:24:09,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:09,722 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:24:09,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:09,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:09,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911289432] [2023-02-16 03:24:09,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911289432] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:09,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:09,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:24:09,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500815898] [2023-02-16 03:24:09,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:09,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:24:09,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:09,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:24:09,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:24:09,749 INFO L87 Difference]: Start difference. First operand has 313 states, 171 states have (on average 1.8654970760233918) internal successors, (319), 294 states have internal predecessors, (319), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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:24:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:10,463 INFO L93 Difference]: Finished difference Result 412 states and 459 transitions. [2023-02-16 03:24:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:24:10,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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:24:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:10,474 INFO L225 Difference]: With dead ends: 412 [2023-02-16 03:24:10,474 INFO L226 Difference]: Without dead ends: 408 [2023-02-16 03:24:10,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:24:10,477 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 299 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:10,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 506 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 03:24:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-02-16 03:24:10,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 344. [2023-02-16 03:24:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 200 states have (on average 1.83) internal successors, (366), 321 states have internal predecessors, (366), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-02-16 03:24:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 402 transitions. [2023-02-16 03:24:10,538 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 402 transitions. Word has length 11 [2023-02-16 03:24:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:10,539 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 402 transitions. [2023-02-16 03:24:10,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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:24:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 402 transitions. [2023-02-16 03:24:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:24:10,540 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:10,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:10,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-16 03:24:10,746 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:24:10,746 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:10,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:10,752 INFO L85 PathProgramCache]: Analyzing trace with hash -297378987, now seen corresponding path program 1 times [2023-02-16 03:24:10,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:10,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419929416] [2023-02-16 03:24:10,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:10,754 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:10,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:10,756 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:24:10,793 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:24:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:10,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:24:10,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:10,952 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:24:10,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:10,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:10,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419929416] [2023-02-16 03:24:10,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419929416] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:10,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:10,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:24:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286398278] [2023-02-16 03:24:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:10,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:24:10,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:10,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:24:10,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:24:10,955 INFO L87 Difference]: Start difference. First operand 344 states and 402 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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:24:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:11,665 INFO L93 Difference]: Finished difference Result 476 states and 564 transitions. [2023-02-16 03:24:11,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:24:11,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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:24:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:11,668 INFO L225 Difference]: With dead ends: 476 [2023-02-16 03:24:11,668 INFO L226 Difference]: Without dead ends: 476 [2023-02-16 03:24:11,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 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:24:11,669 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 131 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:11,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 832 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 03:24:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2023-02-16 03:24:11,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 407. [2023-02-16 03:24:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 256 states have (on average 1.83203125) internal successors, (469), 376 states have internal predecessors, (469), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2023-02-16 03:24:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 520 transitions. [2023-02-16 03:24:11,686 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 520 transitions. Word has length 11 [2023-02-16 03:24:11,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:11,686 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 520 transitions. [2023-02-16 03:24:11,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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:24:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 520 transitions. [2023-02-16 03:24:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:24:11,687 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:11,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:11,694 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:24:11,894 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:24:11,894 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:11,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1184882668, now seen corresponding path program 1 times [2023-02-16 03:24:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:11,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444738062] [2023-02-16 03:24:11,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:11,896 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:11,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:11,910 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:24:11,911 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:24:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:11,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:24:11,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:11,995 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:24:11,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:11,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:11,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444738062] [2023-02-16 03:24:11,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444738062] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:11,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:11,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384940522] [2023-02-16 03:24:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:11,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:24:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:11,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:24:11,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:24:11,998 INFO L87 Difference]: Start difference. First operand 407 states and 520 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:24:12,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:12,153 INFO L93 Difference]: Finished difference Result 649 states and 797 transitions. [2023-02-16 03:24:12,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:24:12,154 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:24:12,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:12,157 INFO L225 Difference]: With dead ends: 649 [2023-02-16 03:24:12,157 INFO L226 Difference]: Without dead ends: 649 [2023-02-16 03:24:12,157 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:24:12,158 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 259 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:12,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1486 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:24:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-02-16 03:24:12,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 392. [2023-02-16 03:24:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 241 states have (on average 1.8215767634854771) internal successors, (439), 362 states have internal predecessors, (439), 21 states have call successors, (21), 9 states have call predecessors, (21), 10 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2023-02-16 03:24:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 494 transitions. [2023-02-16 03:24:12,174 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 494 transitions. Word has length 11 [2023-02-16 03:24:12,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:12,174 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 494 transitions. [2023-02-16 03:24:12,174 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:24:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 494 transitions. [2023-02-16 03:24:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:24:12,175 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:12,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:12,192 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:24:12,382 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:24:12,383 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:12,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1981613461, now seen corresponding path program 1 times [2023-02-16 03:24:12,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:12,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46142289] [2023-02-16 03:24:12,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:12,384 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:12,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:12,385 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:24:12,395 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:24:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:12,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:24:12,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:12,571 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:24:12,593 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:24:12,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:12,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:12,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46142289] [2023-02-16 03:24:12,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46142289] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:12,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:12,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:24:12,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080867296] [2023-02-16 03:24:12,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:12,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:24:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:12,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:24:12,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:24:12,595 INFO L87 Difference]: Start difference. First operand 392 states and 494 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:24:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:13,483 INFO L93 Difference]: Finished difference Result 436 states and 541 transitions. [2023-02-16 03:24:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:24:13,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-16 03:24:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:13,486 INFO L225 Difference]: With dead ends: 436 [2023-02-16 03:24:13,486 INFO L226 Difference]: Without dead ends: 436 [2023-02-16 03:24:13,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:24:13,487 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 61 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:13,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1152 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-16 03:24:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-02-16 03:24:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 404. [2023-02-16 03:24:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 250 states have (on average 1.804) internal successors, (451), 372 states have internal predecessors, (451), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2023-02-16 03:24:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 506 transitions. [2023-02-16 03:24:13,501 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 506 transitions. Word has length 13 [2023-02-16 03:24:13,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:13,501 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 506 transitions. [2023-02-16 03:24:13,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:24:13,502 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 506 transitions. [2023-02-16 03:24:13,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:24:13,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:13,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:13,525 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:24:13,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:13,710 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:13,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:13,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1981613462, now seen corresponding path program 1 times [2023-02-16 03:24:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:13,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060653340] [2023-02-16 03:24:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:13,711 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:13,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:13,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:24:13,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-16 03:24:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:13,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 03:24:13,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:13,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 15 treesize of output 7 [2023-02-16 03:24:13,920 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:24:13,945 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:24:13,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:13,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:13,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060653340] [2023-02-16 03:24:13,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060653340] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:13,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:13,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:24:13,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862338163] [2023-02-16 03:24:13,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:13,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:24:13,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:13,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:24:13,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:24:13,948 INFO L87 Difference]: Start difference. First operand 404 states and 506 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:24:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:14,857 INFO L93 Difference]: Finished difference Result 424 states and 522 transitions. [2023-02-16 03:24:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:24:14,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-16 03:24:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:14,860 INFO L225 Difference]: With dead ends: 424 [2023-02-16 03:24:14,860 INFO L226 Difference]: Without dead ends: 424 [2023-02-16 03:24:14,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:24:14,861 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 34 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:14,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1291 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-16 03:24:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-02-16 03:24:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 413. [2023-02-16 03:24:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 259 states have (on average 1.7915057915057915) internal successors, (464), 381 states have internal predecessors, (464), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2023-02-16 03:24:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 519 transitions. [2023-02-16 03:24:14,870 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 519 transitions. Word has length 13 [2023-02-16 03:24:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:14,870 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 519 transitions. [2023-02-16 03:24:14,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:24:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 519 transitions. [2023-02-16 03:24:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:24:14,871 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:14,871 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:14,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:15,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:15,085 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:15,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:15,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1895308392, now seen corresponding path program 1 times [2023-02-16 03:24:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:15,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837481050] [2023-02-16 03:24:15,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:15,086 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,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:15,087 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:24:15,090 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:24:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:15,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:24:15,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:15,207 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:24:15,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:15,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:15,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837481050] [2023-02-16 03:24:15,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837481050] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:15,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:15,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098190612] [2023-02-16 03:24:15,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:15,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:24:15,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:15,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:24:15,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:24:15,209 INFO L87 Difference]: Start difference. First operand 413 states and 519 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:24:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:15,286 INFO L93 Difference]: Finished difference Result 351 states and 397 transitions. [2023-02-16 03:24:15,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:24:15,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2023-02-16 03:24:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:15,288 INFO L225 Difference]: With dead ends: 351 [2023-02-16 03:24:15,288 INFO L226 Difference]: Without dead ends: 351 [2023-02-16 03:24:15,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:24:15,289 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 10 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:15,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1342 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:24:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-02-16 03:24:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 345. [2023-02-16 03:24:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 199 states have (on average 1.7688442211055277) internal successors, (352), 320 states have internal predecessors, (352), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 17 states have call predecessors, (19), 16 states have call successors, (19) [2023-02-16 03:24:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 387 transitions. [2023-02-16 03:24:15,296 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 387 transitions. Word has length 17 [2023-02-16 03:24:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:15,296 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 387 transitions. [2023-02-16 03:24:15,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:24:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 387 transitions. [2023-02-16 03:24:15,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:24:15,297 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:15,297 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:15,308 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:24:15,508 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:24:15,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:15,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2106255897, now seen corresponding path program 1 times [2023-02-16 03:24:15,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:15,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995890773] [2023-02-16 03:24:15,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:15,510 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,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:15,511 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:24:15,514 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:24:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:15,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:24:15,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:15,602 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:24:15,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:15,648 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:24:15,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:15,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995890773] [2023-02-16 03:24:15,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995890773] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:24:15,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:15,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-16 03:24:15,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778580694] [2023-02-16 03:24:15,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:15,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:24:15,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:15,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:24:15,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:24:15,650 INFO L87 Difference]: Start difference. First operand 345 states and 387 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 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:24:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:15,702 INFO L93 Difference]: Finished difference Result 344 states and 386 transitions. [2023-02-16 03:24:15,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:24:15,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 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 17 [2023-02-16 03:24:15,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:15,704 INFO L225 Difference]: With dead ends: 344 [2023-02-16 03:24:15,704 INFO L226 Difference]: Without dead ends: 344 [2023-02-16 03:24:15,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 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:24:15,705 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 256 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:15,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1052 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:24:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-02-16 03:24:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2023-02-16 03:24:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 199 states have (on average 1.763819095477387) internal successors, (351), 319 states have internal predecessors, (351), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 17 states have call predecessors, (19), 16 states have call successors, (19) [2023-02-16 03:24:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 386 transitions. [2023-02-16 03:24:15,711 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 386 transitions. Word has length 17 [2023-02-16 03:24:15,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:15,711 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 386 transitions. [2023-02-16 03:24:15,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 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:24:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 386 transitions. [2023-02-16 03:24:15,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:24:15,712 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:15,712 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:15,721 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:24:15,918 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:24:15,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:15,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:15,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2106256148, now seen corresponding path program 1 times [2023-02-16 03:24:15,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:15,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719319039] [2023-02-16 03:24:15,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:15,920 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,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:15,921 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:24:15,922 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:24:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:15,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:24:15,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:16,006 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:24:16,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:16,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:16,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719319039] [2023-02-16 03:24:16,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719319039] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:16,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:16,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:24:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504209047] [2023-02-16 03:24:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:16,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:24:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:16,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:24:16,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:24:16,009 INFO L87 Difference]: Start difference. First operand 344 states and 386 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:24:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:16,060 INFO L93 Difference]: Finished difference Result 388 states and 436 transitions. [2023-02-16 03:24:16,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:24:16,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2023-02-16 03:24:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:16,062 INFO L225 Difference]: With dead ends: 388 [2023-02-16 03:24:16,062 INFO L226 Difference]: Without dead ends: 388 [2023-02-16 03:24:16,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:24:16,063 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 40 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:16,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1375 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:24:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-02-16 03:24:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 346. [2023-02-16 03:24:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 201 states have (on average 1.756218905472637) internal successors, (353), 320 states have internal predecessors, (353), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 18 states have call predecessors, (19), 16 states have call successors, (19) [2023-02-16 03:24:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 388 transitions. [2023-02-16 03:24:16,069 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 388 transitions. Word has length 17 [2023-02-16 03:24:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:16,070 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 388 transitions. [2023-02-16 03:24:16,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:24:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 388 transitions. [2023-02-16 03:24:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:24:16,070 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:16,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:16,078 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:24:16,277 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:24:16,277 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:16,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:16,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2134885299, now seen corresponding path program 1 times [2023-02-16 03:24:16,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:16,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529392221] [2023-02-16 03:24:16,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:16,278 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:16,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:16,279 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:24:16,283 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:24:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:16,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:24:16,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:16,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:24:16,405 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:24:16,447 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:24:16,448 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:16,456 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:24:16,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:16,581 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:24:16,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:16,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529392221] [2023-02-16 03:24:16,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529392221] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:24:16,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:16,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-16 03:24:16,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257122431] [2023-02-16 03:24:16,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:16,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:24:16,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:16,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:24:16,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-16 03:24:16,583 INFO L87 Difference]: Start difference. First operand 346 states and 388 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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:24:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:17,696 INFO L93 Difference]: Finished difference Result 381 states and 424 transitions. [2023-02-16 03:24:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:24:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 17 [2023-02-16 03:24:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:17,698 INFO L225 Difference]: With dead ends: 381 [2023-02-16 03:24:17,698 INFO L226 Difference]: Without dead ends: 381 [2023-02-16 03:24:17,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 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:24:17,699 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 233 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:17,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 852 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 707 Invalid, 0 Unknown, 394 Unchecked, 1.1s Time] [2023-02-16 03:24:17,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-02-16 03:24:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 348. [2023-02-16 03:24:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 205 states have (on average 1.7317073170731707) internal successors, (355), 322 states have internal predecessors, (355), 16 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (20), 18 states have call predecessors, (20), 16 states have call successors, (20) [2023-02-16 03:24:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 391 transitions. [2023-02-16 03:24:17,705 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 391 transitions. Word has length 17 [2023-02-16 03:24:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:17,705 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 391 transitions. [2023-02-16 03:24:17,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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:24:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 391 transitions. [2023-02-16 03:24:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:24:17,706 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:17,706 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:17,714 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:24:17,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:17,912 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2134885298, now seen corresponding path program 1 times [2023-02-16 03:24:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:17,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970125004] [2023-02-16 03:24:17,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:17,913 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:17,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:17,914 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:24:17,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-16 03:24:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:17,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:24:17,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:18,004 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:18,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:24:18,096 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_23 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))))) is different from true [2023-02-16 03:24:18,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:24:18,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:24:18,119 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:18,119 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:18,142 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:24:18,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:20,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:20,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970125004] [2023-02-16 03:24:20,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970125004] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:20,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1418533308] [2023-02-16 03:24:20,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:20,292 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:20,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:20,305 INFO L229 MonitoredProcess]: Starting monitored process 12 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:20,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-02-16 03:24:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:20,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:24:20,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:20,416 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:24:20,421 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:20,469 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_33 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_33))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:24:20,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:24:20,482 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:24:20,490 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:24:20,490 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:20,498 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:24:20,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:20,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1418533308] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:20,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:20,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-16 03:24:20,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096759805] [2023-02-16 03:24:20,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:20,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:24:20,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:20,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:24:20,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=70, Unknown=3, NotChecked=34, Total=132 [2023-02-16 03:24:20,621 INFO L87 Difference]: Start difference. First operand 348 states and 391 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:24:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:22,796 INFO L93 Difference]: Finished difference Result 698 states and 811 transitions. [2023-02-16 03:24:22,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:24:22,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2023-02-16 03:24:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:22,798 INFO L225 Difference]: With dead ends: 698 [2023-02-16 03:24:22,798 INFO L226 Difference]: Without dead ends: 698 [2023-02-16 03:24:22,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=33, Invalid=104, Unknown=3, NotChecked=42, Total=182 [2023-02-16 03:24:22,799 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 518 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1082 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:22,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1474 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1586 Invalid, 0 Unknown, 1082 Unchecked, 2.1s Time] [2023-02-16 03:24:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2023-02-16 03:24:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 360. [2023-02-16 03:24:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 215 states have (on average 1.716279069767442) internal successors, (369), 331 states have internal predecessors, (369), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (30), 21 states have call predecessors, (30), 18 states have call successors, (30) [2023-02-16 03:24:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 417 transitions. [2023-02-16 03:24:22,807 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 417 transitions. Word has length 17 [2023-02-16 03:24:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:22,808 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 417 transitions. [2023-02-16 03:24:22,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:24:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 417 transitions. [2023-02-16 03:24:22,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:24:22,810 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:22,810 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:22,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:23,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:23,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:23,217 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:23,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:23,217 INFO L85 PathProgramCache]: Analyzing trace with hash -869422937, now seen corresponding path program 1 times [2023-02-16 03:24:23,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:23,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834476942] [2023-02-16 03:24:23,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:23,218 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:23,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:23,219 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:24:23,221 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:24:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:23,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:24:23,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:23,404 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:24:23,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:23,465 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:24:23,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:23,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834476942] [2023-02-16 03:24:23,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834476942] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:24:23,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:23,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-16 03:24:23,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771007428] [2023-02-16 03:24:23,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:23,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:24:23,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:23,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:24:23,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:24:23,466 INFO L87 Difference]: Start difference. First operand 360 states and 417 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:24:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:23,799 INFO L93 Difference]: Finished difference Result 363 states and 418 transitions. [2023-02-16 03:24:23,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:24:23,800 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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 18 [2023-02-16 03:24:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:23,801 INFO L225 Difference]: With dead ends: 363 [2023-02-16 03:24:23,801 INFO L226 Difference]: Without dead ends: 363 [2023-02-16 03:24:23,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 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:24:23,802 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 814 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:23,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1214 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:24:23,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-02-16 03:24:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2023-02-16 03:24:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 215 states have (on average 1.7069767441860466) internal successors, (367), 330 states have internal predecessors, (367), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (30), 21 states have call predecessors, (30), 18 states have call successors, (30) [2023-02-16 03:24:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 415 transitions. [2023-02-16 03:24:23,807 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 415 transitions. Word has length 18 [2023-02-16 03:24:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:23,807 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 415 transitions. [2023-02-16 03:24:23,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:24:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 415 transitions. [2023-02-16 03:24:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:24:23,808 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:23,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:23,827 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:24:24,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:24,017 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:24,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1883109288, now seen corresponding path program 1 times [2023-02-16 03:24:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:24,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857324946] [2023-02-16 03:24:24,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:24,018 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:24,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:24,032 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:24:24,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-16 03:24:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:24,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:24:24,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:24,129 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:24:24,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:24:24,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:24,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857324946] [2023-02-16 03:24:24,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857324946] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:24:24,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:24:24,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:24:24,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282552677] [2023-02-16 03:24:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:24:24,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:24:24,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:24:24,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:24:24,132 INFO L87 Difference]: Start difference. First operand 359 states and 415 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:24:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:24,784 INFO L93 Difference]: Finished difference Result 362 states and 417 transitions. [2023-02-16 03:24:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:24:24,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-16 03:24:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:24,786 INFO L225 Difference]: With dead ends: 362 [2023-02-16 03:24:24,786 INFO L226 Difference]: Without dead ends: 349 [2023-02-16 03:24:24,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 1 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:24:24,787 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 41 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:24,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 661 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 03:24:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-02-16 03:24:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2023-02-16 03:24:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 206 states have (on average 1.733009708737864) internal successors, (357), 321 states have internal predecessors, (357), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2023-02-16 03:24:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 404 transitions. [2023-02-16 03:24:24,792 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 404 transitions. Word has length 18 [2023-02-16 03:24:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:24,792 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 404 transitions. [2023-02-16 03:24:24,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:24:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 404 transitions. [2023-02-16 03:24:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 03:24:24,792 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:24,793 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:24,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-16 03:24:24,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:24,993 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1969475052, now seen corresponding path program 1 times [2023-02-16 03:24:24,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:24,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105316862] [2023-02-16 03:24:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:24,994 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:24,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:24,996 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:24:24,997 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:24:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:25,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:24:25,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:25,129 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:24:25,129 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:25,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:24:25,236 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:24:25,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:25,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:25,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105316862] [2023-02-16 03:24:25,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105316862] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:25,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2051982748] [2023-02-16 03:24:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:25,278 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:25,279 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:24:25,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-02-16 03:24:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:25,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:24:25,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:25,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-16 03:24:25,491 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:24:25,492 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:25,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:24:25,591 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:24:25,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:25,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2051982748] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:25,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:25,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-02-16 03:24:25,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372441329] [2023-02-16 03:24:25,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:25,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:24:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:25,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:24:25,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:24:25,639 INFO L87 Difference]: Start difference. First operand 349 states and 404 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 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:24:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:24:26,889 INFO L93 Difference]: Finished difference Result 426 states and 479 transitions. [2023-02-16 03:24:26,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:24:26,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 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 21 [2023-02-16 03:24:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:24:26,891 INFO L225 Difference]: With dead ends: 426 [2023-02-16 03:24:26,891 INFO L226 Difference]: Without dead ends: 426 [2023-02-16 03:24:26,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:24:26,892 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 440 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:24:26,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 838 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-16 03:24:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2023-02-16 03:24:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 351. [2023-02-16 03:24:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 208 states have (on average 1.7307692307692308) internal successors, (360), 323 states have internal predecessors, (360), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2023-02-16 03:24:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 407 transitions. [2023-02-16 03:24:26,897 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 407 transitions. Word has length 21 [2023-02-16 03:24:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:24:26,898 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 407 transitions. [2023-02-16 03:24:26,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 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:24:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 407 transitions. [2023-02-16 03:24:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 03:24:26,898 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:24:26,898 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:24:26,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2023-02-16 03:24:27,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-02-16 03:24:27,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:27,301 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:24:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:24:27,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1969475053, now seen corresponding path program 1 times [2023-02-16 03:24:27,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:24:27,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700042933] [2023-02-16 03:24:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:27,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:24:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:24:27,303 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:24:27,305 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:24:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:27,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:24:27,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:29,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:24:29,497 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:24:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:24:31,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:33,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:24:33,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700042933] [2023-02-16 03:24:33,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700042933] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:33,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [244322496] [2023-02-16 03:24:33,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:24:33,921 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:24:33,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:24:33,922 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:24:33,931 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:24:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:24:34,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 03:24:34,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:24:34,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-16 03:24:36,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:24:36,084 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:24:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:24:36,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:24:38,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [244322496] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:24:38,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:24:38,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-02-16 03:24:38,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368481609] [2023-02-16 03:24:38,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:24:38,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:24:38,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:24:38,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:24:38,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=59, Unknown=4, NotChecked=0, Total=90 [2023-02-16 03:24:38,752 INFO L87 Difference]: Start difference. First operand 351 states and 407 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:24:42,988 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,026 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:24:49,046 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:51,055 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:53,069 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:24:55,083 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:57,096 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:05,315 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:07,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:25:09,689 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:12,625 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:14,639 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:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:14,659 INFO L93 Difference]: Finished difference Result 419 states and 472 transitions. [2023-02-16 03:25:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:25:14,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-02-16 03:25:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:14,661 INFO L225 Difference]: With dead ends: 419 [2023-02-16 03:25:14,661 INFO L226 Difference]: Without dead ends: 419 [2023-02-16 03:25:14,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=85, Invalid=148, Unknown=7, NotChecked=0, Total=240 [2023-02-16 03:25:14,662 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 527 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 65 mSolverCounterUnsat, 154 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 154 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:14,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 436 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 564 Invalid, 154 Unknown, 0 Unchecked, 25.7s Time] [2023-02-16 03:25:14,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-02-16 03:25:14,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 350. [2023-02-16 03:25:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 208 states have (on average 1.7211538461538463) internal successors, (358), 322 states have internal predecessors, (358), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2023-02-16 03:25:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 405 transitions. [2023-02-16 03:25:14,667 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 405 transitions. Word has length 21 [2023-02-16 03:25:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:14,667 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 405 transitions. [2023-02-16 03:25:14,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:25:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 405 transitions. [2023-02-16 03:25:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:25:14,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:14,668 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:25:14,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:14,878 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:25:15,075 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:25:15,076 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:25:15,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:15,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1415040467, now seen corresponding path program 1 times [2023-02-16 03:25:15,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:15,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132496808] [2023-02-16 03:25:15,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:15,076 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:15,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:15,078 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:25:15,080 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:25:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:15,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:25:15,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:15,208 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:25:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:25:15,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:25:15,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:15,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132496808] [2023-02-16 03:25:15,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132496808] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:25:15,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:25:15,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:25:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081288457] [2023-02-16 03:25:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:25:15,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:25:15,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:15,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:25:15,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:25:15,228 INFO L87 Difference]: Start difference. First operand 350 states and 405 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:25:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:15,900 INFO L93 Difference]: Finished difference Result 390 states and 447 transitions. [2023-02-16 03:25:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:25:15,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-02-16 03:25:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:15,903 INFO L225 Difference]: With dead ends: 390 [2023-02-16 03:25:15,903 INFO L226 Difference]: Without dead ends: 390 [2023-02-16 03:25:15,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:25:15,904 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 59 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:15,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1036 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 03:25:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-02-16 03:25:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 352. [2023-02-16 03:25:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 210 states have (on average 1.7190476190476192) internal successors, (361), 324 states have internal predecessors, (361), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2023-02-16 03:25:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 408 transitions. [2023-02-16 03:25:15,909 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 408 transitions. Word has length 23 [2023-02-16 03:25:15,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:15,909 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 408 transitions. [2023-02-16 03:25:15,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:25:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 408 transitions. [2023-02-16 03:25:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:25:15,909 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:15,909 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:25:15,931 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:25:16,110 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:25:16,110 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:25:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1415040466, now seen corresponding path program 1 times [2023-02-16 03:25:16,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:16,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968382523] [2023-02-16 03:25:16,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:16,111 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:16,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:16,113 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:25:16,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-16 03:25:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:16,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 03:25:16,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:16,362 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:25:16,367 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:25:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:25:16,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:25:16,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:16,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968382523] [2023-02-16 03:25:16,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968382523] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:25:16,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:25:16,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:25:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350294279] [2023-02-16 03:25:16,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:25:16,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:25:16,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:16,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:25:16,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:25:16,403 INFO L87 Difference]: Start difference. First operand 352 states and 408 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:25:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:17,252 INFO L93 Difference]: Finished difference Result 375 states and 432 transitions. [2023-02-16 03:25:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:25:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-02-16 03:25:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:17,254 INFO L225 Difference]: With dead ends: 375 [2023-02-16 03:25:17,254 INFO L226 Difference]: Without dead ends: 375 [2023-02-16 03:25:17,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:25:17,255 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 41 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:17,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1075 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-16 03:25:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-02-16 03:25:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 352. [2023-02-16 03:25:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 210 states have (on average 1.7142857142857142) internal successors, (360), 324 states have internal predecessors, (360), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2023-02-16 03:25:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 407 transitions. [2023-02-16 03:25:17,260 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 407 transitions. Word has length 23 [2023-02-16 03:25:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:17,261 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 407 transitions. [2023-02-16 03:25:17,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:25:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 407 transitions. [2023-02-16 03:25:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:25:17,262 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:17,262 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:25:17,281 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:25:17,468 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:25:17,469 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:25:17,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:17,469 INFO L85 PathProgramCache]: Analyzing trace with hash -412937067, now seen corresponding path program 1 times [2023-02-16 03:25:17,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:17,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734356920] [2023-02-16 03:25:17,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:17,470 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:17,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:17,471 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:25:17,473 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:25:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:17,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:25:17,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:25:17,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:25:17,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734356920] [2023-02-16 03:25:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734356920] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:25:17,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-16 03:25:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304463988] [2023-02-16 03:25:17,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:17,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:25:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:25:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:25:17,643 INFO L87 Difference]: Start difference. First operand 352 states and 407 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:25:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:17,704 INFO L93 Difference]: Finished difference Result 351 states and 406 transitions. [2023-02-16 03:25:17,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:25:17,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-02-16 03:25:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:17,706 INFO L225 Difference]: With dead ends: 351 [2023-02-16 03:25:17,706 INFO L226 Difference]: Without dead ends: 351 [2023-02-16 03:25:17,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 2 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:25:17,707 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 245 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:17,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1046 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:25:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-02-16 03:25:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2023-02-16 03:25:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 210 states have (on average 1.7095238095238094) internal successors, (359), 323 states have internal predecessors, (359), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2023-02-16 03:25:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 406 transitions. [2023-02-16 03:25:17,712 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 406 transitions. Word has length 25 [2023-02-16 03:25:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:17,712 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 406 transitions. [2023-02-16 03:25:17,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:25:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 406 transitions. [2023-02-16 03:25:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:25:17,713 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:17,713 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:25:17,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-02-16 03:25:17,913 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:25:17,914 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:25:17,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:17,914 INFO L85 PathProgramCache]: Analyzing trace with hash -412937301, now seen corresponding path program 1 times [2023-02-16 03:25:17,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:17,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051548920] [2023-02-16 03:25:17,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:17,915 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:17,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:17,916 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:25:17,918 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:25:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:17,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:25:17,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:25:18,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:25:18,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:18,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051548920] [2023-02-16 03:25:18,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051548920] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:25:18,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:25:18,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:25:18,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198039285] [2023-02-16 03:25:18,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:25:18,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:25:18,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:18,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:25:18,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:25:18,038 INFO L87 Difference]: Start difference. First operand 351 states and 406 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:25:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:18,094 INFO L93 Difference]: Finished difference Result 392 states and 444 transitions. [2023-02-16 03:25:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:25:18,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-02-16 03:25:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:18,095 INFO L225 Difference]: With dead ends: 392 [2023-02-16 03:25:18,095 INFO L226 Difference]: Without dead ends: 392 [2023-02-16 03:25:18,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:25:18,096 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 43 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:18,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1426 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:25:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-02-16 03:25:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 349. [2023-02-16 03:25:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 209 states have (on average 1.6985645933014355) internal successors, (355), 321 states have internal predecessors, (355), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2023-02-16 03:25:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 399 transitions. [2023-02-16 03:25:18,101 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 399 transitions. Word has length 25 [2023-02-16 03:25:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:18,101 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 399 transitions. [2023-02-16 03:25:18,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:25:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 399 transitions. [2023-02-16 03:25:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:25:18,101 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:18,102 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:25:18,108 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:25:18,308 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:25:18,308 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:25:18,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash -441566452, now seen corresponding path program 1 times [2023-02-16 03:25:18,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:18,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702607220] [2023-02-16 03:25:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:18,309 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:18,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:18,311 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:25:18,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 (23)] Waiting until timeout for monitored process [2023-02-16 03:25:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:18,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:25:18,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:18,393 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:18,448 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:25:18,467 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:25:18,468 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:25:18,487 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:25:18,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:18,651 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:25:18,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:18,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702607220] [2023-02-16 03:25:18,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702607220] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:25:18,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:18,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-16 03:25:18,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996284501] [2023-02-16 03:25:18,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:18,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:25:18,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:18,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:25:18,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-16 03:25:18,654 INFO L87 Difference]: Start difference. First operand 349 states and 399 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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:25:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:20,472 INFO L93 Difference]: Finished difference Result 379 states and 425 transitions. [2023-02-16 03:25:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:25:20,472 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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:25:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:20,473 INFO L225 Difference]: With dead ends: 379 [2023-02-16 03:25:20,473 INFO L226 Difference]: Without dead ends: 379 [2023-02-16 03:25:20,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 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:25:20,474 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 183 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 350 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:20,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1016 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 821 Invalid, 0 Unknown, 350 Unchecked, 1.8s Time] [2023-02-16 03:25:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-02-16 03:25:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 351. [2023-02-16 03:25:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 212 states have (on average 1.6886792452830188) internal successors, (358), 323 states have internal predecessors, (358), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2023-02-16 03:25:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 402 transitions. [2023-02-16 03:25:20,479 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 402 transitions. Word has length 25 [2023-02-16 03:25:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:20,479 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 402 transitions. [2023-02-16 03:25:20,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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:25:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 402 transitions. [2023-02-16 03:25:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:25:20,479 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:20,479 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:25:20,503 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:25:20,690 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:25:20,691 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:25:20,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:20,691 INFO L85 PathProgramCache]: Analyzing trace with hash -441566451, now seen corresponding path program 1 times [2023-02-16 03:25:20,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:20,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162448129] [2023-02-16 03:25:20,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:20,692 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:20,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:20,693 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:25:20,695 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:25:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:20,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 03:25:20,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:20,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:25:20,906 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:20,929 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:25:20,929 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:20,954 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:25:20,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:21,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:21,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162448129] [2023-02-16 03:25:21,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162448129] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:21,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2139127040] [2023-02-16 03:25:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:21,226 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:25:21,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:25:21,231 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:25:21,249 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:25:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:21,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:25:21,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:21,373 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:21,382 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:21,592 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_134 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_134))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:25:21,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:25:21,615 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:21,624 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:25:21,624 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:21,639 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:25:21,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:23,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2139127040] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:23,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:23,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-16 03:25:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828859985] [2023-02-16 03:25:23,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:23,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:25:23,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:23,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:25:23,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=172, Unknown=3, NotChecked=54, Total=272 [2023-02-16 03:25:23,870 INFO L87 Difference]: Start difference. First operand 351 states and 402 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 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:25:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:28,246 INFO L93 Difference]: Finished difference Result 681 states and 789 transitions. [2023-02-16 03:25:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:25:28,248 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 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:25:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:28,250 INFO L225 Difference]: With dead ends: 681 [2023-02-16 03:25:28,250 INFO L226 Difference]: Without dead ends: 681 [2023-02-16 03:25:28,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=54, Invalid=223, Unknown=3, NotChecked=62, Total=342 [2023-02-16 03:25:28,250 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 442 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 3334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1054 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:28,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1868 Invalid, 3334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2215 Invalid, 0 Unknown, 1054 Unchecked, 4.2s Time] [2023-02-16 03:25:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-02-16 03:25:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 350. [2023-02-16 03:25:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 212 states have (on average 1.6839622641509433) internal successors, (357), 322 states have internal predecessors, (357), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2023-02-16 03:25:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 401 transitions. [2023-02-16 03:25:28,256 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 401 transitions. Word has length 25 [2023-02-16 03:25:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:28,258 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 401 transitions. [2023-02-16 03:25:28,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 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:25:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 401 transitions. [2023-02-16 03:25:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:25:28,260 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:28,260 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] [2023-02-16 03:25:28,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:28,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-02-16 03:25:28,670 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:25:28,671 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:25:28,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:28,671 INFO L85 PathProgramCache]: Analyzing trace with hash 83853234, now seen corresponding path program 1 times [2023-02-16 03:25:28,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:28,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076183427] [2023-02-16 03:25:28,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:28,672 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:28,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:28,674 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:25:28,676 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:25:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:28,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:25:28,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:25:29,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:25:29,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:29,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076183427] [2023-02-16 03:25:29,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076183427] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:25:29,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:29,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-16 03:25:29,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927477512] [2023-02-16 03:25:29,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:29,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:25:29,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:29,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:25:29,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:25:29,175 INFO L87 Difference]: Start difference. First operand 350 states and 401 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:25:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:29,850 INFO L93 Difference]: Finished difference Result 349 states and 399 transitions. [2023-02-16 03:25:29,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:25:29,850 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2023-02-16 03:25:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:29,851 INFO L225 Difference]: With dead ends: 349 [2023-02-16 03:25:29,852 INFO L226 Difference]: Without dead ends: 349 [2023-02-16 03:25:29,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:25:29,852 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 578 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:29,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1219 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 03:25:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-02-16 03:25:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2023-02-16 03:25:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 212 states have (on average 1.6745283018867925) internal successors, (355), 321 states have internal predecessors, (355), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2023-02-16 03:25:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 399 transitions. [2023-02-16 03:25:29,858 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 399 transitions. Word has length 26 [2023-02-16 03:25:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:29,858 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 399 transitions. [2023-02-16 03:25:29,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:25:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 399 transitions. [2023-02-16 03:25:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:25:29,859 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:29,859 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, 1, 1, 1] [2023-02-16 03:25:29,885 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:25:30,069 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:25:30,070 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:25:30,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:30,070 INFO L85 PathProgramCache]: Analyzing trace with hash -366162574, now seen corresponding path program 1 times [2023-02-16 03:25:30,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:30,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047687059] [2023-02-16 03:25:30,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:30,070 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:30,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:30,072 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:25:30,076 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:25:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:30,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 03:25:30,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:30,365 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:25:30,373 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:25:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:25:30,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:25:30,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:30,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047687059] [2023-02-16 03:25:30,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047687059] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:25:30,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:25:30,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:25:30,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332967432] [2023-02-16 03:25:30,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:25:30,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:25:30,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:30,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:25:30,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:25:30,442 INFO L87 Difference]: Start difference. First operand 349 states and 399 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:25:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:30,834 INFO L93 Difference]: Finished difference Result 355 states and 404 transitions. [2023-02-16 03:25:30,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:25:30,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-02-16 03:25:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:30,838 INFO L225 Difference]: With dead ends: 355 [2023-02-16 03:25:30,838 INFO L226 Difference]: Without dead ends: 355 [2023-02-16 03:25:30,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:25:30,838 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 13 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:30,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1236 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:25:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-02-16 03:25:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2023-02-16 03:25:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 214 states have (on average 1.6682242990654206) internal successors, (357), 323 states have internal predecessors, (357), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2023-02-16 03:25:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 401 transitions. [2023-02-16 03:25:30,848 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 401 transitions. Word has length 26 [2023-02-16 03:25:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:30,849 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 401 transitions. [2023-02-16 03:25:30,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:25:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 401 transitions. [2023-02-16 03:25:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:25:30,861 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:30,862 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, 1, 1, 1, 1, 1] [2023-02-16 03:25:30,879 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:31,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:25:31,070 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:25:31,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash 305064464, now seen corresponding path program 1 times [2023-02-16 03:25:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:31,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81606030] [2023-02-16 03:25:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:31,071 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:31,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:31,073 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:25:31,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-02-16 03:25:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:31,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:25:31,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:31,297 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~client~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~client~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~client~0#1.base|)))) is different from true [2023-02-16 03:25:31,355 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:25:31,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:31,508 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret65#1.base_29| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret65#1.base_29|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret65#1.base_29| (_ bv0 1))))) is different from false [2023-02-16 03:25:31,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:31,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81606030] [2023-02-16 03:25:31,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81606030] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:31,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [906580579] [2023-02-16 03:25:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:31,510 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:25:31,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:25:31,511 INFO L229 MonitoredProcess]: Starting monitored process 29 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:31,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-02-16 03:25:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:31,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:25:31,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:31,829 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:25:31,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:31,920 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret65#1.base_32| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret65#1.base_32|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret65#1.base_32| (_ bv0 1))))) is different from false [2023-02-16 03:25:31,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [906580579] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:31,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:31,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-02-16 03:25:31,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015940294] [2023-02-16 03:25:31,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:31,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:25:31,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:31,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:25:31,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=126, Unknown=3, NotChecked=72, Total=240 [2023-02-16 03:25:31,923 INFO L87 Difference]: Start difference. First operand 351 states and 401 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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:25:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:34,529 INFO L93 Difference]: Finished difference Result 363 states and 412 transitions. [2023-02-16 03:25:34,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:25:34,530 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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 28 [2023-02-16 03:25:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:34,531 INFO L225 Difference]: With dead ends: 363 [2023-02-16 03:25:34,532 INFO L226 Difference]: Without dead ends: 347 [2023-02-16 03:25:34,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=276, Unknown=3, NotChecked=108, Total=462 [2023-02-16 03:25:34,532 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 363 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:34,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1196 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1072 Invalid, 3 Unknown, 345 Unchecked, 2.5s Time] [2023-02-16 03:25:34,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-02-16 03:25:34,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2023-02-16 03:25:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 209 states have (on average 1.6794258373205742) internal successors, (351), 319 states have internal predecessors, (351), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2023-02-16 03:25:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 394 transitions. [2023-02-16 03:25:34,547 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 394 transitions. Word has length 28 [2023-02-16 03:25:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:34,547 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 394 transitions. [2023-02-16 03:25:34,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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:25:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 394 transitions. [2023-02-16 03:25:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:25:34,556 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:34,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:25:34,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:34,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:34,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:25:34,960 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:25:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1048245233, now seen corresponding path program 1 times [2023-02-16 03:25:34,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:34,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768915434] [2023-02-16 03:25:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:34,961 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:34,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:34,962 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:25:34,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-16 03:25:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:35,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:25:35,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:35,077 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:25:35,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:25:35,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:35,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768915434] [2023-02-16 03:25:35,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768915434] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:25:35,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:25:35,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:25:35,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099213562] [2023-02-16 03:25:35,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:25:35,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:25:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:35,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:25:35,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:25:35,079 INFO L87 Difference]: Start difference. First operand 345 states and 394 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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:25:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:35,150 INFO L93 Difference]: Finished difference Result 336 states and 384 transitions. [2023-02-16 03:25:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:25:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 28 [2023-02-16 03:25:35,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:35,151 INFO L225 Difference]: With dead ends: 336 [2023-02-16 03:25:35,151 INFO L226 Difference]: Without dead ends: 336 [2023-02-16 03:25:35,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:25:35,152 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 245 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:35,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1053 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:25:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-02-16 03:25:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2023-02-16 03:25:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 200 states have (on average 1.705) internal successors, (341), 310 states have internal predecessors, (341), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2023-02-16 03:25:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 384 transitions. [2023-02-16 03:25:35,156 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 384 transitions. Word has length 28 [2023-02-16 03:25:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:35,156 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 384 transitions. [2023-02-16 03:25:35,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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:25:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 384 transitions. [2023-02-16 03:25:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:25:35,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:35,157 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] [2023-02-16 03:25:35,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-02-16 03:25:35,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:25:35,357 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:25:35,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1975256279, now seen corresponding path program 1 times [2023-02-16 03:25:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:35,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797001959] [2023-02-16 03:25:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:35,358 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:35,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:35,370 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:35,372 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:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:35,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:25:35,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:35,474 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:35,577 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:25:35,577 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:25:35,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:25:35,696 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:25:35,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:36,002 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:25:36,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:36,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797001959] [2023-02-16 03:25:36,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797001959] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:25:36,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:36,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-02-16 03:25:36,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573532818] [2023-02-16 03:25:36,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:36,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:25:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:36,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:25:36,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:25:36,003 INFO L87 Difference]: Start difference. First operand 336 states and 384 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 03:25:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:25:38,462 INFO L93 Difference]: Finished difference Result 389 states and 435 transitions. [2023-02-16 03:25:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:25:38,463 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2023-02-16 03:25:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:25:38,468 INFO L225 Difference]: With dead ends: 389 [2023-02-16 03:25:38,468 INFO L226 Difference]: Without dead ends: 389 [2023-02-16 03:25:38,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:25:38,468 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 599 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:25:38,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1361 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-02-16 03:25:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-02-16 03:25:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 339. [2023-02-16 03:25:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 203 states have (on average 1.6945812807881773) internal successors, (344), 313 states have internal predecessors, (344), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2023-02-16 03:25:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 387 transitions. [2023-02-16 03:25:38,499 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 387 transitions. Word has length 30 [2023-02-16 03:25:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:25:38,499 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 387 transitions. [2023-02-16 03:25:38,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 03:25:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 387 transitions. [2023-02-16 03:25:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 03:25:38,500 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:25:38,500 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] [2023-02-16 03:25:38,509 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 (31)] Ended with exit code 0 [2023-02-16 03:25:38,707 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:38,707 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:25:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:25:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash -154246822, now seen corresponding path program 1 times [2023-02-16 03:25:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:25:38,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170771005] [2023-02-16 03:25:38,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:38,708 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:38,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:25:38,709 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:38,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-16 03:25:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:38,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 03:25:38,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:38,873 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:25:38,874 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:25:38,965 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:25:38,965 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:25:39,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:25:39,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:25:39,128 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:25:39,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:39,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:25:39,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170771005] [2023-02-16 03:25:39,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170771005] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:39,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1362850803] [2023-02-16 03:25:39,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:25:39,221 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:25:39,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:25:39,222 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:25:39,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-02-16 03:25:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:25:39,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:25:39,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:25:39,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-16 03:25:39,422 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:25:39,422 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:25:39,525 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:25:39,525 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:25:39,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2023-02-16 03:25:39,867 INFO L321 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2023-02-16 03:25:39,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 43 [2023-02-16 03:25:39,916 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:25:39,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:25:40,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1362850803] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:25:40,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:25:40,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 13 [2023-02-16 03:25:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895946202] [2023-02-16 03:25:40,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:25:40,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 03:25:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:25:40,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 03:25:40,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2023-02-16 03:25:40,141 INFO L87 Difference]: Start difference. First operand 339 states and 387 transitions. Second operand has 15 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 03:25:42,192 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:46,221 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:48,232 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:50,290 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:52,297 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:54,300 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:56,304 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:58,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:00,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:01,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:03,840 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:05,873 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:08,584 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:10,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:12,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:14,292 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:16,335 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:18,374 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:20,488 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:22,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:25,127 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:27,294 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:29,351 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:31,379 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:33,440 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:35,820 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:37,865 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:40,097 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:42,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:26:44,760 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:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:44,772 INFO L93 Difference]: Finished difference Result 457 states and 507 transitions. [2023-02-16 03:26:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:26:44,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 32 [2023-02-16 03:26:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:44,774 INFO L225 Difference]: With dead ends: 457 [2023-02-16 03:26:44,774 INFO L226 Difference]: Without dead ends: 457 [2023-02-16 03:26:44,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=176, Invalid=525, Unknown=1, NotChecked=0, Total=702 [2023-02-16 03:26:44,775 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 786 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 142 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:44,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1302 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1228 Invalid, 29 Unknown, 0 Unchecked, 62.4s Time] [2023-02-16 03:26:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-02-16 03:26:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 341. [2023-02-16 03:26:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 205 states have (on average 1.6878048780487804) internal successors, (346), 315 states have internal predecessors, (346), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2023-02-16 03:26:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 389 transitions. [2023-02-16 03:26:44,779 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 389 transitions. Word has length 32 [2023-02-16 03:26:44,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:44,780 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 389 transitions. [2023-02-16 03:26:44,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 03:26:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 389 transitions. [2023-02-16 03:26:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:26:44,780 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:44,780 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] [2023-02-16 03:26:44,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2023-02-16 03:26:45,002 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:45,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:45,196 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:26:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1682263433, now seen corresponding path program 1 times [2023-02-16 03:26:45,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:45,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490753534] [2023-02-16 03:26:45,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:45,197 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:45,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:45,198 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:26:45,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-02-16 03:26:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:45,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:26:45,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:26:45,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:26:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:26:45,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:26:45,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490753534] [2023-02-16 03:26:45,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490753534] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:26:45,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:26:45,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-16 03:26:45,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59423129] [2023-02-16 03:26:45,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:26:45,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:26:45,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:26:45,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:26:45,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:26:45,353 INFO L87 Difference]: Start difference. First operand 341 states and 389 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:26:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:45,395 INFO L93 Difference]: Finished difference Result 340 states and 388 transitions. [2023-02-16 03:26:45,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:26:45,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-02-16 03:26:45,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:45,397 INFO L225 Difference]: With dead ends: 340 [2023-02-16 03:26:45,397 INFO L226 Difference]: Without dead ends: 340 [2023-02-16 03:26:45,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 2 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:26:45,398 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 237 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:45,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1041 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:26:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-02-16 03:26:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2023-02-16 03:26:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 205 states have (on average 1.6829268292682926) internal successors, (345), 314 states have internal predecessors, (345), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2023-02-16 03:26:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 388 transitions. [2023-02-16 03:26:45,403 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 388 transitions. Word has length 33 [2023-02-16 03:26:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:45,404 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 388 transitions. [2023-02-16 03:26:45,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:26:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 388 transitions. [2023-02-16 03:26:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:26:45,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:45,404 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] [2023-02-16 03:26:45,423 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 (34)] Forceful destruction successful, exit code 0 [2023-02-16 03:26:45,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:26:45,624 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:26:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1653634066, now seen corresponding path program 1 times [2023-02-16 03:26:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:45,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343916654] [2023-02-16 03:26:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:45,625 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:45,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:45,627 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:26:45,628 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:26:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:45,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-16 03:26:45,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:45,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:26:45,735 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:26:45,836 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_262 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_262))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_263 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_263))))) is different from true [2023-02-16 03:26:45,875 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:26:45,876 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:26:45,883 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:26:45,945 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_264 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_264))) (exists ((v_ArrVal_265 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_265))))) is different from true [2023-02-16 03:26:45,980 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:26:45,980 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:26:46,000 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:26:46,039 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_266 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_266))))) is different from true [2023-02-16 03:26:46,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:26:46,052 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:26:46,059 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:26:46,059 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:26:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 12 not checked. [2023-02-16 03:26:46,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:26:48,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:26:48,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343916654] [2023-02-16 03:26:48,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343916654] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:26:48,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [478230709] [2023-02-16 03:26:48,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:48,316 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:26:48,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:26:48,317 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:26:48,318 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:26:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:48,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-16 03:26:48,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:48,506 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:26:48,512 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:26:48,612 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:26:48,612 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:26:48,620 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:26:48,703 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_294 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_294))) (exists ((v_ArrVal_293 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_293))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:26:48,745 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:26:48,746 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:26:48,750 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:26:48,802 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_295 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_295))))) is different from true [2023-02-16 03:26:48,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:26:48,816 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:26:48,825 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:26:48,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:26:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 10 not checked. [2023-02-16 03:26:48,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:26:51,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [478230709] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:26:51,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:26:51,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 14 [2023-02-16 03:26:51,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003520355] [2023-02-16 03:26:51,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:26:51,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 03:26:51,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:26:51,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 03:26:51,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=109, Unknown=6, NotChecked=120, Total=272 [2023-02-16 03:26:51,055 INFO L87 Difference]: Start difference. First operand 340 states and 388 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-16 03:26:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:54,598 INFO L93 Difference]: Finished difference Result 361 states and 405 transitions. [2023-02-16 03:26:54,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:26:54,599 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 33 [2023-02-16 03:26:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:54,600 INFO L225 Difference]: With dead ends: 361 [2023-02-16 03:26:54,600 INFO L226 Difference]: Without dead ends: 361 [2023-02-16 03:26:54,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=53, Invalid=171, Unknown=6, NotChecked=150, Total=380 [2023-02-16 03:26:54,600 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 442 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 50 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 1675 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:54,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 997 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1373 Invalid, 53 Unknown, 1675 Unchecked, 3.3s Time] [2023-02-16 03:26:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-02-16 03:26:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 331. [2023-02-16 03:26:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 199 states have (on average 1.6834170854271358) internal successors, (335), 307 states have internal predecessors, (335), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (24), 17 states have call predecessors, (24), 16 states have call successors, (24) [2023-02-16 03:26:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 375 transitions. [2023-02-16 03:26:54,605 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 375 transitions. Word has length 33 [2023-02-16 03:26:54,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:54,605 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 375 transitions. [2023-02-16 03:26:54,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-16 03:26:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 375 transitions. [2023-02-16 03:26:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 03:26:54,606 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:54,606 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] [2023-02-16 03:26:54,632 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 (35)] Forceful destruction successful, exit code 0 [2023-02-16 03:26:54,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2023-02-16 03:26:55,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:26:55,016 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:26:55,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash 610559287, now seen corresponding path program 1 times [2023-02-16 03:26:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:55,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957507372] [2023-02-16 03:26:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:55,017 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:55,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:55,018 INFO L229 MonitoredProcess]: Starting monitored process 37 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:55,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-02-16 03:26:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:55,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:26:55,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:26:55,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:26:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:26:55,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:26:55,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957507372] [2023-02-16 03:26:55,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957507372] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:26:55,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:26:55,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-16 03:26:55,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707077907] [2023-02-16 03:26:55,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:26:55,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:26:55,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:26:55,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:26:55,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:26:55,472 INFO L87 Difference]: Start difference. First operand 331 states and 375 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:26:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:55,969 INFO L93 Difference]: Finished difference Result 332 states and 376 transitions. [2023-02-16 03:26:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:26:55,969 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 34 [2023-02-16 03:26:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:55,971 INFO L225 Difference]: With dead ends: 332 [2023-02-16 03:26:55,971 INFO L226 Difference]: Without dead ends: 332 [2023-02-16 03:26:55,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:26:55,972 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 754 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:55,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1433 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:26:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-02-16 03:26:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2023-02-16 03:26:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 199 states have (on average 1.678391959798995) internal successors, (334), 306 states have internal predecessors, (334), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (24), 17 states have call predecessors, (24), 16 states have call successors, (24) [2023-02-16 03:26:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 374 transitions. [2023-02-16 03:26:55,996 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 374 transitions. Word has length 34 [2023-02-16 03:26:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:55,997 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 374 transitions. [2023-02-16 03:26:55,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:26:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 374 transitions. [2023-02-16 03:26:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 03:26:55,997 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:55,997 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] [2023-02-16 03:26:56,008 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 (37)] Forceful destruction successful, exit code 0 [2023-02-16 03:26:56,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:56,209 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:26:56,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:56,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2092671515, now seen corresponding path program 1 times [2023-02-16 03:26:56,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:56,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108491118] [2023-02-16 03:26:56,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:56,210 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:56,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:56,211 INFO L229 MonitoredProcess]: Starting monitored process 38 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:56,213 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 (38)] Waiting until timeout for monitored process [2023-02-16 03:26:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:56,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 03:26:56,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:56,482 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:26:56,482 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:26:56,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:26:56,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:26:56,651 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 23 [2023-02-16 03:26:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:26:56,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:26:56,802 INFO L321 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2023-02-16 03:26:56,803 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 32 treesize of output 31 [2023-02-16 03:26:57,000 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:26:57,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:26:57,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108491118] [2023-02-16 03:26:57,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108491118] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 03:26:57,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:26:57,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 16 [2023-02-16 03:26:57,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679031679] [2023-02-16 03:26:57,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:26:57,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:26:57,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:26:57,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:26:57,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:26:57,002 INFO L87 Difference]: Start difference. First operand 330 states and 374 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:26:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:57,985 INFO L93 Difference]: Finished difference Result 370 states and 416 transitions. [2023-02-16 03:26:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:26:57,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-02-16 03:26:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:57,987 INFO L225 Difference]: With dead ends: 370 [2023-02-16 03:26:57,987 INFO L226 Difference]: Without dead ends: 370 [2023-02-16 03:26:57,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-02-16 03:26:57,988 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 98 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:57,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1449 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-16 03:26:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-02-16 03:26:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 332. [2023-02-16 03:26:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 201 states have (on average 1.6766169154228856) internal successors, (337), 308 states have internal predecessors, (337), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (24), 17 states have call predecessors, (24), 16 states have call successors, (24) [2023-02-16 03:26:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 377 transitions. [2023-02-16 03:26:58,010 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 377 transitions. Word has length 34 [2023-02-16 03:26:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:58,011 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 377 transitions. [2023-02-16 03:26:58,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:26:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 377 transitions. [2023-02-16 03:26:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 03:26:58,011 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:58,011 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] [2023-02-16 03:26:58,021 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 (38)] Forceful destruction successful, exit code 0 [2023-02-16 03:26:58,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:58,221 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:26:58,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2092671516, now seen corresponding path program 1 times [2023-02-16 03:26:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:58,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517731059] [2023-02-16 03:26:58,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:58,222 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:58,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:58,223 INFO L229 MonitoredProcess]: Starting monitored process 39 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:58,225 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 (39)] Waiting until timeout for monitored process [2023-02-16 03:26:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:58,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 03:26:58,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:58,598 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:26:58,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:26:58,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:26:58,621 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:26:58,621 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:26:58,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:26:58,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:26:59,006 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 38 treesize of output 30 [2023-02-16 03:26:59,027 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:26:59,027 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 34 treesize of output 32 [2023-02-16 03:26:59,035 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:26:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:26:59,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:26:59,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:26:59,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2023-02-16 03:26:59,342 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 12 treesize of output 10 [2023-02-16 03:27:00,071 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:27:00,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:00,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517731059] [2023-02-16 03:27:00,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517731059] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:00,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:27:00,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 16 [2023-02-16 03:27:00,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274612774] [2023-02-16 03:27:00,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:00,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:27:00,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:00,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:27:00,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:27:00,073 INFO L87 Difference]: Start difference. First operand 332 states and 377 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:27:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:03,220 INFO L93 Difference]: Finished difference Result 370 states and 416 transitions. [2023-02-16 03:27:03,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:27:03,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-02-16 03:27:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:03,223 INFO L225 Difference]: With dead ends: 370 [2023-02-16 03:27:03,223 INFO L226 Difference]: Without dead ends: 370 [2023-02-16 03:27:03,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2023-02-16 03:27:03,223 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 69 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:03,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1777 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-02-16 03:27:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-02-16 03:27:03,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 332. [2023-02-16 03:27:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 201 states have (on average 1.671641791044776) internal successors, (336), 308 states have internal predecessors, (336), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (24), 17 states have call predecessors, (24), 16 states have call successors, (24) [2023-02-16 03:27:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 376 transitions. [2023-02-16 03:27:03,228 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 376 transitions. Word has length 34 [2023-02-16 03:27:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:03,228 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 376 transitions. [2023-02-16 03:27:03,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:27:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 376 transitions. [2023-02-16 03:27:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 03:27:03,229 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:03,229 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] [2023-02-16 03:27:03,251 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 (39)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:03,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:03,436 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:03,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1747469131, now seen corresponding path program 1 times [2023-02-16 03:27:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:03,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273471742] [2023-02-16 03:27:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:03,437 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:03,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:03,449 INFO L229 MonitoredProcess]: Starting monitored process 40 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:03,500 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 (40)] Waiting until timeout for monitored process [2023-02-16 03:27:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:03,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:27:03,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:03,564 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:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:03,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:03,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:03,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273471742] [2023-02-16 03:27:03,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273471742] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:03,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:03,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-02-16 03:27:03,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583299217] [2023-02-16 03:27:03,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:03,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:27:03,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:03,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:27:03,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:27:03,743 INFO L87 Difference]: Start difference. First operand 332 states and 376 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:05,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:27:06,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:27:09,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:27:10,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:27:12,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:27:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:12,189 INFO L93 Difference]: Finished difference Result 356 states and 396 transitions. [2023-02-16 03:27:12,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:27:12,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2023-02-16 03:27:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:12,191 INFO L225 Difference]: With dead ends: 356 [2023-02-16 03:27:12,191 INFO L226 Difference]: Without dead ends: 356 [2023-02-16 03:27:12,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:27:12,192 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 166 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 28 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:12,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 998 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 795 Invalid, 5 Unknown, 0 Unchecked, 8.4s Time] [2023-02-16 03:27:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-02-16 03:27:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 335. [2023-02-16 03:27:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 204 states have (on average 1.661764705882353) internal successors, (339), 311 states have internal predecessors, (339), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (24), 17 states have call predecessors, (24), 16 states have call successors, (24) [2023-02-16 03:27:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 379 transitions. [2023-02-16 03:27:12,197 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 379 transitions. Word has length 35 [2023-02-16 03:27:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:12,197 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 379 transitions. [2023-02-16 03:27:12,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 379 transitions. [2023-02-16 03:27:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:27:12,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:12,198 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] [2023-02-16 03:27:12,207 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 (40)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:12,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:12,405 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:12,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:12,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1327181508, now seen corresponding path program 1 times [2023-02-16 03:27:12,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:12,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641026258] [2023-02-16 03:27:12,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:12,406 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:12,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:12,407 INFO L229 MonitoredProcess]: Starting monitored process 41 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:12,411 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 (41)] Waiting until timeout for monitored process [2023-02-16 03:27:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:12,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:27:12,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:12,526 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:27:12,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:12,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:12,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641026258] [2023-02-16 03:27:12,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641026258] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:12,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:12,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:27:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556020356] [2023-02-16 03:27:12,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:12,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:27:12,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:12,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:27:12,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:27:12,528 INFO L87 Difference]: Start difference. First operand 335 states and 379 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:27:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:13,064 INFO L93 Difference]: Finished difference Result 353 states and 399 transitions. [2023-02-16 03:27:13,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:27:13,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 37 [2023-02-16 03:27:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:13,066 INFO L225 Difference]: With dead ends: 353 [2023-02-16 03:27:13,066 INFO L226 Difference]: Without dead ends: 353 [2023-02-16 03:27:13,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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:27:13,068 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 42 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:13,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 725 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:27:13,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-02-16 03:27:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 336. [2023-02-16 03:27:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 206 states have (on average 1.6601941747572815) internal successors, (342), 312 states have internal predecessors, (342), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (24), 17 states have call predecessors, (24), 16 states have call successors, (24) [2023-02-16 03:27:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 382 transitions. [2023-02-16 03:27:13,072 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 382 transitions. Word has length 37 [2023-02-16 03:27:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:13,072 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 382 transitions. [2023-02-16 03:27:13,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:27:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 382 transitions. [2023-02-16 03:27:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:27:13,073 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:13,073 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] [2023-02-16 03:27:13,083 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 (41)] Ended with exit code 0 [2023-02-16 03:27:13,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:13,274 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:13,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:13,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1327181509, now seen corresponding path program 1 times [2023-02-16 03:27:13,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:13,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093652000] [2023-02-16 03:27:13,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:13,274 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:13,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:13,276 INFO L229 MonitoredProcess]: Starting monitored process 42 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:13,278 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 (42)] Waiting until timeout for monitored process [2023-02-16 03:27:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:13,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:27:13,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:13,682 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:27:13,683 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:27:13,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:27:13,721 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:27:13,721 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:27:13,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:27:13,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:27:14,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 38 treesize of output 30 [2023-02-16 03:27:14,096 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 34 treesize of output 26 [2023-02-16 03:27:14,109 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:14,110 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 30 treesize of output 28 [2023-02-16 03:27:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:14,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:14,371 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 12 treesize of output 10 [2023-02-16 03:27:14,657 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:27:14,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:14,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093652000] [2023-02-16 03:27:14,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093652000] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:14,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:27:14,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2023-02-16 03:27:14,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925067777] [2023-02-16 03:27:14,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:14,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:27:14,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:14,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:27:14,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:27:14,663 INFO L87 Difference]: Start difference. First operand 336 states and 382 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:27:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:15,841 INFO L93 Difference]: Finished difference Result 342 states and 387 transitions. [2023-02-16 03:27:15,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:27:15,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2023-02-16 03:27:15,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:15,844 INFO L225 Difference]: With dead ends: 342 [2023-02-16 03:27:15,844 INFO L226 Difference]: Without dead ends: 342 [2023-02-16 03:27:15,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2023-02-16 03:27:15,844 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 39 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:15,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1656 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-16 03:27:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-02-16 03:27:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2023-02-16 03:27:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 208 states have (on average 1.6538461538461537) internal successors, (344), 314 states have internal predecessors, (344), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (24), 17 states have call predecessors, (24), 16 states have call successors, (24) [2023-02-16 03:27:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 384 transitions. [2023-02-16 03:27:15,848 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 384 transitions. Word has length 37 [2023-02-16 03:27:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:15,848 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 384 transitions. [2023-02-16 03:27:15,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:27:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 384 transitions. [2023-02-16 03:27:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:27:15,848 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:15,848 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, 1] [2023-02-16 03:27:15,856 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 (42)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:16,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:16,049 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:16,049 INFO L85 PathProgramCache]: Analyzing trace with hash -445295076, now seen corresponding path program 1 times [2023-02-16 03:27:16,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:16,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584657021] [2023-02-16 03:27:16,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:16,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:16,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:16,052 INFO L229 MonitoredProcess]: Starting monitored process 43 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:16,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-02-16 03:27:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:16,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:27:16,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:16,183 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:16,256 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:16,257 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:16,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:27:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:27:16,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:27:16,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:16,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584657021] [2023-02-16 03:27:16,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584657021] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:16,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:16,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-02-16 03:27:16,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835406041] [2023-02-16 03:27:16,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:16,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:27:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:27:16,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:27:16,601 INFO L87 Difference]: Start difference. First operand 338 states and 384 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 03:27:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:19,785 INFO L93 Difference]: Finished difference Result 387 states and 431 transitions. [2023-02-16 03:27:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:27:19,785 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2023-02-16 03:27:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:19,787 INFO L225 Difference]: With dead ends: 387 [2023-02-16 03:27:19,787 INFO L226 Difference]: Without dead ends: 387 [2023-02-16 03:27:19,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:27:19,787 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 447 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 67 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:19,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1549 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1525 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2023-02-16 03:27:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-02-16 03:27:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 341. [2023-02-16 03:27:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 211 states have (on average 1.6445497630331753) internal successors, (347), 317 states have internal predecessors, (347), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (24), 17 states have call predecessors, (24), 16 states have call successors, (24) [2023-02-16 03:27:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 387 transitions. [2023-02-16 03:27:19,791 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 387 transitions. Word has length 38 [2023-02-16 03:27:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:19,792 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 387 transitions. [2023-02-16 03:27:19,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 03:27:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 387 transitions. [2023-02-16 03:27:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 03:27:19,792 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:19,792 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, 1] [2023-02-16 03:27:19,802 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 (43)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:20,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:20,000 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:20,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:20,000 INFO L85 PathProgramCache]: Analyzing trace with hash -183877918, now seen corresponding path program 1 times [2023-02-16 03:27:20,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:20,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930436913] [2023-02-16 03:27:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:20,001 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:20,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:20,002 INFO L229 MonitoredProcess]: Starting monitored process 44 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:20,004 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 (44)] Waiting until timeout for monitored process [2023-02-16 03:27:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:20,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 03:27:20,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:22,635 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_431 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~cfg~2#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~client~0#1.base| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~client~0#1.base| v_ArrVal_431))) (let ((.cse0 (store .cse1 |ULTIMATE.start_entry_point_~cfg~2#1.base| (_ bv0 1)))) (and (= |c_#valid| (store .cse0 |ULTIMATE.start_entry_point_~client~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select .cse1 |ULTIMATE.start_entry_point_~cfg~2#1.base|)) (not (= (_ bv0 32) |ULTIMATE.start_entry_point_~client~0#1.base|)) (= (_ bv0 1) (bvadd (select .cse0 |ULTIMATE.start_entry_point_~client~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~client~0#1.base|)))))) is different from true [2023-02-16 03:27:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-16 03:27:22,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:22,995 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 15 treesize of output 13 [2023-02-16 03:27:25,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:25,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930436913] [2023-02-16 03:27:25,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930436913] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:25,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [239291460] [2023-02-16 03:27:25,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:25,424 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:25,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:25,425 INFO L229 MonitoredProcess]: Starting monitored process 45 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:25,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2023-02-16 03:27:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:25,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:27:25,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:28,590 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_454 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~cfg~2#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~client~0#1.base| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~client~0#1.base| v_ArrVal_454))) (let ((.cse0 (store .cse1 |ULTIMATE.start_entry_point_~cfg~2#1.base| (_ bv0 1)))) (and (= (_ bv0 1) (bvadd (select .cse0 |ULTIMATE.start_entry_point_~client~0#1.base|) (_ bv1 1))) (= |c_#valid| (store .cse0 |ULTIMATE.start_entry_point_~client~0#1.base| (_ bv0 1))) (not (= |ULTIMATE.start_entry_point_~client~0#1.base| (_ bv0 32))) (= (_ bv0 1) (select .cse1 |ULTIMATE.start_entry_point_~cfg~2#1.base|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~client~0#1.base|)))))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32)))) is different from true [2023-02-16 03:27:28,776 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:27:28,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:31,076 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 15 treesize of output 13 [2023-02-16 03:27:37,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [239291460] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:37,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:37,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2023-02-16 03:27:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681119770] [2023-02-16 03:27:37,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:37,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 03:27:37,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:37,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 03:27:37,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=699, Unknown=9, NotChecked=110, Total=930 [2023-02-16 03:27:37,534 INFO L87 Difference]: Start difference. First operand 341 states and 387 transitions. Second operand has 22 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 6 states have call successors, (6), 1 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:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:48,005 INFO L93 Difference]: Finished difference Result 356 states and 401 transitions. [2023-02-16 03:27:48,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:27:48,006 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 6 states have call successors, (6), 1 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 39 [2023-02-16 03:27:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:48,007 INFO L225 Difference]: With dead ends: 356 [2023-02-16 03:27:48,007 INFO L226 Difference]: Without dead ends: 339 [2023-02-16 03:27:48,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=189, Invalid=1142, Unknown=9, NotChecked=142, Total=1482 [2023-02-16 03:27:48,008 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 393 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 2653 mSolverCounterSat, 59 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 3410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2653 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 688 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:48,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 2597 Invalid, 3410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2653 Invalid, 10 Unknown, 688 Unchecked, 6.5s Time] [2023-02-16 03:27:48,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-02-16 03:27:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2023-02-16 03:27:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 209 states have (on average 1.6507177033492824) internal successors, (345), 316 states have internal predecessors, (345), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-16 03:27:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 384 transitions. [2023-02-16 03:27:48,013 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 384 transitions. Word has length 39 [2023-02-16 03:27:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:48,013 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 384 transitions. [2023-02-16 03:27:48,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 6 states have call successors, (6), 1 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:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 384 transitions. [2023-02-16 03:27:48,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 03:27:48,014 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:48,014 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:48,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Ended with exit code 0 [2023-02-16 03:27:48,226 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 (44)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:48,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:48,417 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:48,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash 224946307, now seen corresponding path program 1 times [2023-02-16 03:27:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:48,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990998496] [2023-02-16 03:27:48,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:48,418 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:48,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:48,419 INFO L229 MonitoredProcess]: Starting monitored process 46 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:48,421 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 (46)] Waiting until timeout for monitored process [2023-02-16 03:27:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:48,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:27:48,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:48,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:48,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:48,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990998496] [2023-02-16 03:27:48,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990998496] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:48,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:48,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:27:48,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685960081] [2023-02-16 03:27:48,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:48,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:27:48,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:27:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:48,551 INFO L87 Difference]: Start difference. First operand 339 states and 384 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:48,597 INFO L93 Difference]: Finished difference Result 327 states and 371 transitions. [2023-02-16 03:27:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:27:48,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-02-16 03:27:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:48,599 INFO L225 Difference]: With dead ends: 327 [2023-02-16 03:27:48,599 INFO L226 Difference]: Without dead ends: 327 [2023-02-16 03:27:48,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:27:48,600 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 236 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:48,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1039 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:27:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-16 03:27:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2023-02-16 03:27:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 197 states have (on average 1.6852791878172588) internal successors, (332), 304 states have internal predecessors, (332), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-16 03:27:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 371 transitions. [2023-02-16 03:27:48,605 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 371 transitions. Word has length 39 [2023-02-16 03:27:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:48,606 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 371 transitions. [2023-02-16 03:27:48,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 371 transitions. [2023-02-16 03:27:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:27:48,606 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:48,606 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-02-16 03:27:48,614 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 (46)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:48,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:48,814 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1294605214, now seen corresponding path program 1 times [2023-02-16 03:27:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:48,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431011088] [2023-02-16 03:27:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:48,815 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:48,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:48,817 INFO L229 MonitoredProcess]: Starting monitored process 47 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:48,819 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 (47)] Waiting until timeout for monitored process [2023-02-16 03:27:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:48,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:27:48,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:27:48,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:48,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:48,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431011088] [2023-02-16 03:27:48,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431011088] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:48,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:48,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:27:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977067578] [2023-02-16 03:27:48,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:48,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:27:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:48,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:27:48,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:48,966 INFO L87 Difference]: Start difference. First operand 327 states and 371 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:49,004 INFO L93 Difference]: Finished difference Result 368 states and 416 transitions. [2023-02-16 03:27:49,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:27:49,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2023-02-16 03:27:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:49,006 INFO L225 Difference]: With dead ends: 368 [2023-02-16 03:27:49,006 INFO L226 Difference]: Without dead ends: 368 [2023-02-16 03:27:49,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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:27:49,007 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 43 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:49,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1285 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:27:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-02-16 03:27:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 329. [2023-02-16 03:27:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 199 states have (on average 1.678391959798995) internal successors, (334), 305 states have internal predecessors, (334), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (23), 17 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-16 03:27:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 373 transitions. [2023-02-16 03:27:49,010 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 373 transitions. Word has length 41 [2023-02-16 03:27:49,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:49,010 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 373 transitions. [2023-02-16 03:27:49,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:49,010 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 373 transitions. [2023-02-16 03:27:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:27:49,011 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:49,011 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-02-16 03:27:49,035 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 (47)] Ended with exit code 0 [2023-02-16 03:27:49,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:49,218 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:49,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:49,219 INFO L85 PathProgramCache]: Analyzing trace with hash -789046589, now seen corresponding path program 2 times [2023-02-16 03:27:49,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:49,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699318344] [2023-02-16 03:27:49,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:27:49,219 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:49,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:49,221 INFO L229 MonitoredProcess]: Starting monitored process 48 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:49,223 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 (48)] Waiting until timeout for monitored process [2023-02-16 03:27:49,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:27:49,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:27:49,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:27:49,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-16 03:27:49,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-16 03:27:49,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:49,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699318344] [2023-02-16 03:27:49,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699318344] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:49,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:49,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-16 03:27:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637961038] [2023-02-16 03:27:49,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:49,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:27:49,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:49,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:27:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:49,406 INFO L87 Difference]: Start difference. First operand 329 states and 373 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:49,461 INFO L93 Difference]: Finished difference Result 328 states and 372 transitions. [2023-02-16 03:27:49,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:27:49,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2023-02-16 03:27:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:49,462 INFO L225 Difference]: With dead ends: 328 [2023-02-16 03:27:49,462 INFO L226 Difference]: Without dead ends: 328 [2023-02-16 03:27:49,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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:27:49,463 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 228 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:49,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1027 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:27:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-02-16 03:27:49,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2023-02-16 03:27:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 199 states have (on average 1.6733668341708543) internal successors, (333), 304 states have internal predecessors, (333), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (23), 17 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-16 03:27:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 372 transitions. [2023-02-16 03:27:49,466 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 372 transitions. Word has length 41 [2023-02-16 03:27:49,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:49,466 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 372 transitions. [2023-02-16 03:27:49,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 372 transitions. [2023-02-16 03:27:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:27:49,467 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:49,467 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, 1, 1, 1, 1] [2023-02-16 03:27:49,495 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 (48)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:49,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:49,682 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:49,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:49,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1368793298, now seen corresponding path program 1 times [2023-02-16 03:27:49,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:49,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223881454] [2023-02-16 03:27:49,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:49,683 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:49,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:49,684 INFO L229 MonitoredProcess]: Starting monitored process 49 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:49,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2023-02-16 03:27:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:49,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 03:27:49,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:49,795 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:49,873 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:49,873 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:49,953 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:49,954 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 19 treesize of output 27 [2023-02-16 03:27:50,057 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:27:50,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:27:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:50,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:50,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:50,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223881454] [2023-02-16 03:27:50,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223881454] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:50,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1724535878] [2023-02-16 03:27:50,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:50,379 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:50,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:50,381 INFO L229 MonitoredProcess]: Starting monitored process 50 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:50,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (50)] Waiting until timeout for monitored process [2023-02-16 03:27:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:50,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 03:27:50,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:50,565 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:50,621 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:50,621 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:50,747 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:50,748 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 19 treesize of output 27 [2023-02-16 03:27:50,899 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:27:50,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:27:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-16 03:27:50,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:51,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1724535878] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:51,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:51,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2023-02-16 03:27:51,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248928596] [2023-02-16 03:27:51,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:51,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:27:51,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:51,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:27:51,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-16 03:27:51,233 INFO L87 Difference]: Start difference. First operand 328 states and 372 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (4), 2 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:27:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:53,646 INFO L93 Difference]: Finished difference Result 348 states and 388 transitions. [2023-02-16 03:27:53,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:27:53,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2023-02-16 03:27:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:53,647 INFO L225 Difference]: With dead ends: 348 [2023-02-16 03:27:53,647 INFO L226 Difference]: Without dead ends: 348 [2023-02-16 03:27:53,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:27:53,648 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 668 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:53,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1294 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-02-16 03:27:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-02-16 03:27:53,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 331. [2023-02-16 03:27:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 202 states have (on average 1.6633663366336633) internal successors, (336), 307 states have internal predecessors, (336), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (23), 17 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-16 03:27:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 375 transitions. [2023-02-16 03:27:53,651 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 375 transitions. Word has length 41 [2023-02-16 03:27:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:53,652 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 375 transitions. [2023-02-16 03:27:53,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (4), 2 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:27:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 375 transitions. [2023-02-16 03:27:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:27:53,652 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:53,652 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-02-16 03:27:53,667 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 (49)] Ended with exit code 0 [2023-02-16 03:27:53,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (50)] Ended with exit code 0 [2023-02-16 03:27:54,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:54,071 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:54,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1309353403, now seen corresponding path program 1 times [2023-02-16 03:27:54,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:54,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666511345] [2023-02-16 03:27:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:54,072 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:54,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:54,073 INFO L229 MonitoredProcess]: Starting monitored process 51 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:54,075 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 (51)] Waiting until timeout for monitored process [2023-02-16 03:27:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:54,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:27:54,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-16 03:27:54,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:54,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:54,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666511345] [2023-02-16 03:27:54,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666511345] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:54,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:54,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:27:54,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897438412] [2023-02-16 03:27:54,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:54,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:27:54,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:54,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:27:54,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:54,222 INFO L87 Difference]: Start difference. First operand 331 states and 375 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-16 03:27:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:54,263 INFO L93 Difference]: Finished difference Result 385 states and 433 transitions. [2023-02-16 03:27:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:27:54,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2023-02-16 03:27:54,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:54,265 INFO L225 Difference]: With dead ends: 385 [2023-02-16 03:27:54,265 INFO L226 Difference]: Without dead ends: 385 [2023-02-16 03:27:54,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:27:54,266 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 50 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:54,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1405 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:27:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-02-16 03:27:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 333. [2023-02-16 03:27:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 204 states have (on average 1.6568627450980393) internal successors, (338), 308 states have internal predecessors, (338), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-16 03:27:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 377 transitions. [2023-02-16 03:27:54,270 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 377 transitions. Word has length 42 [2023-02-16 03:27:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:54,270 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 377 transitions. [2023-02-16 03:27:54,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-16 03:27:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 377 transitions. [2023-02-16 03:27:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:27:54,272 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:54,272 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-02-16 03:27:54,282 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 (51)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:54,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:54,480 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:54,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1309359926, now seen corresponding path program 1 times [2023-02-16 03:27:54,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:54,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452000142] [2023-02-16 03:27:54,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:54,481 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:54,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:54,484 INFO L229 MonitoredProcess]: Starting monitored process 52 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:54,485 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 (52)] Waiting until timeout for monitored process [2023-02-16 03:27:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:54,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:27:54,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-16 03:27:55,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-16 03:27:55,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:55,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452000142] [2023-02-16 03:27:55,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452000142] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:55,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:55,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-16 03:27:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494457205] [2023-02-16 03:27:55,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:55,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:27:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:55,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:27:55,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:27:55,173 INFO L87 Difference]: Start difference. First operand 333 states and 377 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-16 03:27:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:55,644 INFO L93 Difference]: Finished difference Result 334 states and 378 transitions. [2023-02-16 03:27:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:27:55,645 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2023-02-16 03:27:55,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:55,646 INFO L225 Difference]: With dead ends: 334 [2023-02-16 03:27:55,646 INFO L226 Difference]: Without dead ends: 334 [2023-02-16 03:27:55,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:27:55,647 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 274 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:55,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1207 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:27:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-02-16 03:27:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2023-02-16 03:27:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 204 states have (on average 1.6519607843137254) internal successors, (337), 307 states have internal predecessors, (337), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-16 03:27:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 376 transitions. [2023-02-16 03:27:55,653 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 376 transitions. Word has length 42 [2023-02-16 03:27:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:55,653 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 376 transitions. [2023-02-16 03:27:55,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-16 03:27:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 376 transitions. [2023-02-16 03:27:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:27:55,654 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:55,654 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 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:55,663 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 (52)] Ended with exit code 0 [2023-02-16 03:27:55,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:55,861 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:55,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:55,861 INFO L85 PathProgramCache]: Analyzing trace with hash 421849722, now seen corresponding path program 1 times [2023-02-16 03:27:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:55,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652452284] [2023-02-16 03:27:55,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:55,862 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:55,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:55,862 INFO L229 MonitoredProcess]: Starting monitored process 53 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:55,865 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 (53)] Waiting until timeout for monitored process [2023-02-16 03:27:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:55,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:27:55,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:55,983 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:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-16 03:27:56,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:56,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:56,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652452284] [2023-02-16 03:27:56,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652452284] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:56,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:56,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:27:56,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601728971] [2023-02-16 03:27:56,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:56,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:27:56,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:56,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:27:56,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:56,013 INFO L87 Difference]: Start difference. First operand 332 states and 376 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-16 03:27:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:56,670 INFO L93 Difference]: Finished difference Result 335 states and 379 transitions. [2023-02-16 03:27:56,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:27:56,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2023-02-16 03:27:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:56,672 INFO L225 Difference]: With dead ends: 335 [2023-02-16 03:27:56,672 INFO L226 Difference]: Without dead ends: 335 [2023-02-16 03:27:56,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:27:56,673 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 14 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:56,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 929 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 03:27:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-02-16 03:27:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2023-02-16 03:27:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 204 states have (on average 1.6470588235294117) internal successors, (336), 306 states have internal predecessors, (336), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-16 03:27:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 375 transitions. [2023-02-16 03:27:56,678 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 375 transitions. Word has length 42 [2023-02-16 03:27:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:56,685 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 375 transitions. [2023-02-16 03:27:56,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-16 03:27:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 375 transitions. [2023-02-16 03:27:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:27:56,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:56,686 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 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:56,694 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 (53)] Ended with exit code 0 [2023-02-16 03:27:56,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:56,900 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:56,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:56,900 INFO L85 PathProgramCache]: Analyzing trace with hash 421849723, now seen corresponding path program 1 times [2023-02-16 03:27:56,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:56,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147637544] [2023-02-16 03:27:56,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:56,901 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:56,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:56,902 INFO L229 MonitoredProcess]: Starting monitored process 54 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:56,904 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 (54)] Waiting until timeout for monitored process [2023-02-16 03:27:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:57,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:27:57,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:57,053 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:27:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-16 03:27:57,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:57,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:57,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147637544] [2023-02-16 03:27:57,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147637544] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:57,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:57,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:27:57,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124297593] [2023-02-16 03:27:57,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:57,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:27:57,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:57,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:27:57,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:27:57,097 INFO L87 Difference]: Start difference. First operand 331 states and 375 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-16 03:27:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:58,120 INFO L93 Difference]: Finished difference Result 381 states and 429 transitions. [2023-02-16 03:27:58,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:27:58,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2023-02-16 03:27:58,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:58,122 INFO L225 Difference]: With dead ends: 381 [2023-02-16 03:27:58,122 INFO L226 Difference]: Without dead ends: 381 [2023-02-16 03:27:58,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:27:58,123 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 54 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:58,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1399 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-16 03:27:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-02-16 03:27:58,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 330. [2023-02-16 03:27:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 204 states have (on average 1.642156862745098) internal successors, (335), 305 states have internal predecessors, (335), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-16 03:27:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 374 transitions. [2023-02-16 03:27:58,127 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 374 transitions. Word has length 42 [2023-02-16 03:27:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:58,127 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 374 transitions. [2023-02-16 03:27:58,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-16 03:27:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 374 transitions. [2023-02-16 03:27:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:27:58,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:58,127 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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:58,136 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 (54)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:58,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:58,328 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:27:58,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1935452453, now seen corresponding path program 1 times [2023-02-16 03:27:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:58,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883349231] [2023-02-16 03:27:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:58,329 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:58,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:58,330 INFO L229 MonitoredProcess]: Starting monitored process 55 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:58,332 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 (55)] Waiting until timeout for monitored process [2023-02-16 03:27:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:58,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:27:58,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:58,443 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,493 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:27:58,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:27:58,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:58,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883349231] [2023-02-16 03:27:58,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883349231] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:58,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:58,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-02-16 03:27:58,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660429206] [2023-02-16 03:27:58,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:58,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:27:58,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:58,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:27:58,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:27:58,585 INFO L87 Difference]: Start difference. First operand 330 states and 374 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-16 03:28:00,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:28:02,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:28:03,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:28:04,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:28:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:28:04,619 INFO L93 Difference]: Finished difference Result 348 states and 388 transitions. [2023-02-16 03:28:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:28:04,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2023-02-16 03:28:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:28:04,621 INFO L225 Difference]: With dead ends: 348 [2023-02-16 03:28:04,621 INFO L226 Difference]: Without dead ends: 348 [2023-02-16 03:28:04,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:28:04,621 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 155 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 26 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:28:04,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 984 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 773 Invalid, 4 Unknown, 0 Unchecked, 6.0s Time] [2023-02-16 03:28:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-02-16 03:28:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 333. [2023-02-16 03:28:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 207 states have (on average 1.6328502415458936) internal successors, (338), 308 states have internal predecessors, (338), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-16 03:28:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 377 transitions. [2023-02-16 03:28:04,625 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 377 transitions. Word has length 43 [2023-02-16 03:28:04,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:28:04,625 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 377 transitions. [2023-02-16 03:28:04,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-16 03:28:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 377 transitions. [2023-02-16 03:28:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:28:04,625 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:28:04,626 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, 1, 1, 1, 1, 1, 1] [2023-02-16 03:28:04,633 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 (55)] Forceful destruction successful, exit code 0 [2023-02-16 03:28:04,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:28:04,833 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2023-02-16 03:28:04,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:28:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1150380693, now seen corresponding path program 1 times [2023-02-16 03:28:04,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:28:04,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664678527] [2023-02-16 03:28:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:28:04,834 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:28:04,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:28:04,835 INFO L229 MonitoredProcess]: Starting monitored process 56 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:28:04,837 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 (56)] Waiting until timeout for monitored process [2023-02-16 03:28:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:28:04,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-16 03:28:04,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:28:05,028 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:28:05,028 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:28:05,120 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:28:05,120 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:28:05,251 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:28:05,251 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:28:05,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:28:05,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:28:05,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:28:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:28:05,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:28:05,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:28:05,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664678527] [2023-02-16 03:28:05,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664678527] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:28:05,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1081230710] [2023-02-16 03:28:05,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:28:05,688 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:28:05,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:28:05,689 INFO L229 MonitoredProcess]: Starting monitored process 57 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:28:05,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (57)] Waiting until timeout for monitored process [2023-02-16 03:28:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:28:05,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-16 03:28:05,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:28:05,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-16 03:28:05,991 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:28:05,992 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:28:06,087 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:28:06,087 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:28:06,412 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-16 03:28:06,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-02-16 03:28:07,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 30 [2023-02-16 03:28:07,367 INFO L321 Elim1Store]: treesize reduction 60, result has 27.7 percent of original size [2023-02-16 03:28:07,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 57 [2023-02-16 03:28:07,713 INFO L321 Elim1Store]: treesize reduction 64, result has 26.4 percent of original size [2023-02-16 03:28:07,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 57 [2023-02-16 03:28:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:28:07,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:28:08,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1081230710] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:28:08,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:28:08,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17] total 21 [2023-02-16 03:28:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760199346] [2023-02-16 03:28:08,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:28:08,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 03:28:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:28:08,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 03:28:08,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2023-02-16 03:28:08,319 INFO L87 Difference]: Start difference. First operand 333 states and 377 transitions. Second operand has 23 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 03:28:10,376 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:28:14,418 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:28:16,427 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:28:18,469 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:28:20,475 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:28:22,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:28:24,514 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:28:26,517 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:28:28,522 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:28:30,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:28:32,263 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:28:34,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:28:36,272 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:28:38,311 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:28:40,314 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:28:42,316 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:28:44,318 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:28:46,369 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]