./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 e8d55036 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-?-e8d5503-m [2023-02-15 22:04:49,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:04:49,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:04:49,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:04:49,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:04:49,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:04:49,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:04:49,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:04:49,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:04:49,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:04:49,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:04:49,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:04:49,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:04:49,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:04:49,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:04:49,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:04:49,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:04:49,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:04:49,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:04:49,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:04:49,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:04:49,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:04:49,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:04:49,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:04:49,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:04:49,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:04:49,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:04:49,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:04:49,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:04:49,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:04:49,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:04:49,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:04:49,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:04:49,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:04:49,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:04:49,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:04:49,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:04:49,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:04:49,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:04:49,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:04:49,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:04:49,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:04:49,516 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:04:49,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:04:49,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:04:49,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:04:49,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:04:49,518 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:04:49,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:04:49,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:04:49,519 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:04:49,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:04:49,520 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:04:49,520 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:04:49,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:04:49,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:04:49,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:04:49,520 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:04:49,520 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:04:49,521 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:04:49,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:04:49,521 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:04:49,521 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:04:49,521 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:04:49,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:04:49,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:04:49,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:04:49,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:04:49,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:04:49,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:04:49,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:04:49,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:04:49,523 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:04:49,523 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:04:49,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:04:49,523 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:04:49,523 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-15 22:04:49,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:04:49,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:04:49,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:04:49,740 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:04:49,740 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:04:49,741 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-15 22:04:50,648 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:04:50,866 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:04:50,867 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-1.i [2023-02-15 22:04:50,877 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8fe5fa0/1528dbd7fdcc43f084474b7554c02b12/FLAG5a422dcca [2023-02-15 22:04:51,250 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8fe5fa0/1528dbd7fdcc43f084474b7554c02b12 [2023-02-15 22:04:51,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:04:51,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:04:51,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:04:51,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:04:51,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:04:51,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:04:51" (1/1) ... [2023-02-15 22:04:51,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd7171b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:51, skipping insertion in model container [2023-02-15 22:04:51,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:04:51" (1/1) ... [2023-02-15 22:04:51,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:04:51,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:04:51,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:04:51,698 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-15 22:04:51,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@27444d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:51, skipping insertion in model container [2023-02-15 22:04:51,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:04:51,704 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 22:04:51,705 INFO L158 Benchmark]: Toolchain (without parser) took 449.73ms. Allocated memory is still 148.9MB. Free memory was 110.8MB in the beginning and 96.3MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 22:04:51,705 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 55.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:04:51,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.18ms. Allocated memory is still 148.9MB. Free memory was 110.8MB in the beginning and 96.3MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 22:04:51,707 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.16ms. Allocated memory is still 113.2MB. Free memory is still 55.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.18ms. Allocated memory is still 148.9MB. Free memory was 110.8MB in the beginning and 96.3MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_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-?-e8d5503-m [2023-02-15 22:04:53,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:04:53,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:04:53,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:04:53,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:04:53,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:04:53,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:04:53,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:04:53,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:04:53,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:04:53,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:04:53,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:04:53,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:04:53,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:04:53,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:04:53,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:04:53,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:04:53,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:04:53,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:04:53,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:04:53,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:04:53,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:04:53,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:04:53,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:04:53,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:04:53,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:04:53,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:04:53,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:04:53,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:04:53,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:04:53,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:04:53,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:04:53,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:04:53,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:04:53,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:04:53,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:04:53,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:04:53,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:04:53,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:04:53,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:04:53,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:04:53,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 22:04:53,454 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:04:53,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:04:53,455 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:04:53,455 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:04:53,456 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:04:53,456 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:04:53,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:04:53,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:04:53,457 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:04:53,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:04:53,458 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:04:53,458 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:04:53,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:04:53,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:04:53,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:04:53,459 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:04:53,459 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:04:53,459 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:04:53,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:04:53,459 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:04:53,459 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:04:53,459 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:04:53,460 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:04:53,460 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:04:53,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:04:53,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:04:53,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:04:53,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:04:53,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:04:53,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:04:53,461 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:04:53,461 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:04:53,461 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:04:53,461 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:04:53,462 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:04:53,462 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:04:53,462 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:04:53,462 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-15 22:04:53,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:04:53,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:04:53,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:04:53,692 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:04:53,692 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:04:53,693 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-15 22:04:54,637 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:04:54,887 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:04:54,887 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-1.i [2023-02-15 22:04:54,900 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20698a5d2/991c5950a665477980090d084a9049c0/FLAG12d621931 [2023-02-15 22:04:54,921 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20698a5d2/991c5950a665477980090d084a9049c0 [2023-02-15 22:04:54,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:04:54,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:04:54,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:04:54,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:04:54,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:04:54,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:04:54" (1/1) ... [2023-02-15 22:04:54,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a19913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:54, skipping insertion in model container [2023-02-15 22:04:54,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:04:54" (1/1) ... [2023-02-15 22:04:54,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:04:54,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:04:55,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:04:55,305 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 22:04:55,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:04:55,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:04:55,381 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:04:55,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:04:55,476 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:04:55,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55 WrapperNode [2023-02-15 22:04:55,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:04:55,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:04:55,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:04:55,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:04:55,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55" (1/1) ... [2023-02-15 22:04:55,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55" (1/1) ... [2023-02-15 22:04:55,548 INFO L138 Inliner]: procedures = 179, calls = 145, calls flagged for inlining = 33, calls inlined = 20, statements flattened = 331 [2023-02-15 22:04:55,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:04:55,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:04:55,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:04:55,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:04:55,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55" (1/1) ... [2023-02-15 22:04:55,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55" (1/1) ... [2023-02-15 22:04:55,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55" (1/1) ... [2023-02-15 22:04:55,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55" (1/1) ... [2023-02-15 22:04:55,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55" (1/1) ... [2023-02-15 22:04:55,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55" (1/1) ... [2023-02-15 22:04:55,610 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55" (1/1) ... [2023-02-15 22:04:55,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55" (1/1) ... [2023-02-15 22:04:55,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:04:55,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:04:55,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:04:55,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:04:55,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55" (1/1) ... [2023-02-15 22:04:55,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:04:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:04:55,645 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-15 22:04:55,649 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-15 22:04:55,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-02-15 22:04:55,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 22:04:55,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-02-15 22:04:55,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-02-15 22:04:55,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-02-15 22:04:55,692 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-02-15 22:04:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2023-02-15 22:04:55,693 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2023-02-15 22:04:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-15 22:04:55,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-15 22:04:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-15 22:04:55,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-15 22:04:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2023-02-15 22:04:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-02-15 22:04:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:04:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:04:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2023-02-15 22:04:55,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2023-02-15 22:04:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 22:04:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:04:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2023-02-15 22:04:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:04:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-02-15 22:04:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:04:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:04:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-02-15 22:04:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2023-02-15 22:04:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:04:55,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:04:55,922 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:04:55,924 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:04:55,926 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-02-15 22:04:56,715 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:04:56,725 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:04:56,727 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:04:56,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:04:56 BoogieIcfgContainer [2023-02-15 22:04:56,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:04:56,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:04:56,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:04:56,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:04:56,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:04:54" (1/3) ... [2023-02-15 22:04:56,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7304c3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:04:56, skipping insertion in model container [2023-02-15 22:04:56,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:55" (2/3) ... [2023-02-15 22:04:56,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7304c3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:04:56, skipping insertion in model container [2023-02-15 22:04:56,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:04:56" (3/3) ... [2023-02-15 22:04:56,735 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test12-1.i [2023-02-15 22:04:56,745 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:04:56,745 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 124 error locations. [2023-02-15 22:04:56,786 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:04:56,792 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;@1a0c3ba3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:04:56,792 INFO L358 AbstractCegarLoop]: Starting to check reachability of 124 error locations. [2023-02-15 22:04:56,796 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-15 22:04:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:04:56,802 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:56,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:56,803 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-15 22:04:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:56,807 INFO L85 PathProgramCache]: Analyzing trace with hash -297378988, now seen corresponding path program 1 times [2023-02-15 22:04:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:56,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548647100] [2023-02-15 22:04:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:56,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-15 22:04:56,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:56,817 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-15 22:04:56,867 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-15 22:04:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:56,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:04:56,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:57,089 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-15 22:04:57,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:04:57,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:57,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548647100] [2023-02-15 22:04:57,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548647100] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:04:57,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:04:57,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:04:57,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329964820] [2023-02-15 22:04:57,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:04:57,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:04:57,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:57,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:04:57,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:04:57,142 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-15 22:04:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:57,830 INFO L93 Difference]: Finished difference Result 412 states and 459 transitions. [2023-02-15 22:04:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:04:57,832 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-15 22:04:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:57,840 INFO L225 Difference]: With dead ends: 412 [2023-02-15 22:04:57,842 INFO L226 Difference]: Without dead ends: 408 [2023-02-15 22:04:57,843 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-15 22:04:57,850 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 299 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:57,850 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.6s Time] [2023-02-15 22:04:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-02-15 22:04:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 344. [2023-02-15 22:04:57,889 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-15 22:04:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 402 transitions. [2023-02-15 22:04:57,891 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 402 transitions. Word has length 11 [2023-02-15 22:04:57,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:57,891 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 402 transitions. [2023-02-15 22:04:57,891 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-15 22:04:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 402 transitions. [2023-02-15 22:04:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:04:57,892 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:57,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:57,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 22:04:58,099 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-15 22:04:58,101 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-15 22:04:58,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash -297378987, now seen corresponding path program 1 times [2023-02-15 22:04:58,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:58,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126981694] [2023-02-15 22:04:58,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:58,103 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-15 22:04:58,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:58,104 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-15 22:04:58,106 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-15 22:04:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:58,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:04:58,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:58,255 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-15 22:04:58,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:04:58,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:58,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126981694] [2023-02-15 22:04:58,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126981694] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:04:58,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:04:58,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:04:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923564902] [2023-02-15 22:04:58,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:04:58,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:04:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:58,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:04:58,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:04:58,258 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-15 22:04:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:58,804 INFO L93 Difference]: Finished difference Result 476 states and 564 transitions. [2023-02-15 22:04:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:04:58,805 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-15 22:04:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:58,807 INFO L225 Difference]: With dead ends: 476 [2023-02-15 22:04:58,807 INFO L226 Difference]: Without dead ends: 476 [2023-02-15 22:04:58,807 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-15 22:04:58,808 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 131 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:58,808 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.5s Time] [2023-02-15 22:04:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2023-02-15 22:04:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 407. [2023-02-15 22:04:58,821 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-15 22:04:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 520 transitions. [2023-02-15 22:04:58,823 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 520 transitions. Word has length 11 [2023-02-15 22:04:58,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:58,823 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 520 transitions. [2023-02-15 22:04:58,823 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-15 22:04:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 520 transitions. [2023-02-15 22:04:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:04:58,824 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:58,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:58,843 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-15 22:04:59,030 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-15 22:04:59,031 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-15 22:04:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1184882668, now seen corresponding path program 1 times [2023-02-15 22:04:59,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:59,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147475216] [2023-02-15 22:04:59,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:59,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:59,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:59,036 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-15 22:04:59,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 22:04:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:59,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:04:59,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:59,155 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-15 22:04:59,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:04:59,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:59,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147475216] [2023-02-15 22:04:59,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147475216] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:04:59,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:04:59,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:04:59,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428308524] [2023-02-15 22:04:59,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:04:59,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:04:59,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:59,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:04:59,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:04:59,157 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-15 22:04:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:59,259 INFO L93 Difference]: Finished difference Result 649 states and 797 transitions. [2023-02-15 22:04:59,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:04:59,260 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-15 22:04:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:59,276 INFO L225 Difference]: With dead ends: 649 [2023-02-15 22:04:59,276 INFO L226 Difference]: Without dead ends: 649 [2023-02-15 22:04:59,276 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-15 22:04:59,277 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-15 22:04:59,277 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-15 22:04:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-02-15 22:04:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 392. [2023-02-15 22:04:59,301 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-15 22:04:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 494 transitions. [2023-02-15 22:04:59,303 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 494 transitions. Word has length 11 [2023-02-15 22:04:59,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:59,303 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 494 transitions. [2023-02-15 22:04:59,303 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-15 22:04:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 494 transitions. [2023-02-15 22:04:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:04:59,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:59,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:59,326 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-15 22:04:59,523 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-15 22:04:59,524 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-15 22:04:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1981613461, now seen corresponding path program 1 times [2023-02-15 22:04:59,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:59,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082558955] [2023-02-15 22:04:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:59,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-15 22:04:59,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:59,526 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-15 22:04:59,528 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-15 22:04:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:59,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:04:59,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:59,705 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-15 22:04:59,726 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-15 22:04:59,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:04:59,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:59,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082558955] [2023-02-15 22:04:59,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082558955] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:04:59,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:04:59,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:04:59,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133207999] [2023-02-15 22:04:59,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:04:59,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:04:59,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:59,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:04:59,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:04:59,728 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-15 22:05:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:00,528 INFO L93 Difference]: Finished difference Result 436 states and 541 transitions. [2023-02-15 22:05:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:05:00,530 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-15 22:05:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:00,531 INFO L225 Difference]: With dead ends: 436 [2023-02-15 22:05:00,531 INFO L226 Difference]: Without dead ends: 436 [2023-02-15 22:05:00,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:05:00,532 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-15 22:05:00,532 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-15 22:05:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-02-15 22:05:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 404. [2023-02-15 22:05:00,539 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-15 22:05:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 506 transitions. [2023-02-15 22:05:00,540 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 506 transitions. Word has length 13 [2023-02-15 22:05:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:00,541 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 506 transitions. [2023-02-15 22:05:00,541 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-15 22:05:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 506 transitions. [2023-02-15 22:05:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:05:00,541 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:00,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:00,548 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 (5)] Ended with exit code 0 [2023-02-15 22:05:00,748 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-15 22:05:00,748 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-15 22:05:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1981613462, now seen corresponding path program 1 times [2023-02-15 22:05:00,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:00,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002718693] [2023-02-15 22:05:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:00,749 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-15 22:05:00,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:00,750 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-15 22:05:00,752 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-15 22:05:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:00,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:05:00,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:00,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:05:00,950 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-15 22:05:00,974 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-15 22:05:00,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:00,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:00,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002718693] [2023-02-15 22:05:00,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002718693] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:00,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:00,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:05:00,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935769876] [2023-02-15 22:05:00,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:00,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:05:00,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:00,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:05:00,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:05:00,975 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-15 22:05:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:01,781 INFO L93 Difference]: Finished difference Result 424 states and 522 transitions. [2023-02-15 22:05:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:05:01,782 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-15 22:05:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:01,784 INFO L225 Difference]: With dead ends: 424 [2023-02-15 22:05:01,784 INFO L226 Difference]: Without dead ends: 424 [2023-02-15 22:05:01,784 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-15 22:05:01,785 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 34 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-15 22:05:01,785 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-15 22:05:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-02-15 22:05:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 413. [2023-02-15 22:05:01,792 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-15 22:05:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 519 transitions. [2023-02-15 22:05:01,793 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 519 transitions. Word has length 13 [2023-02-15 22:05:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:01,793 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 519 transitions. [2023-02-15 22:05:01,794 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-15 22:05:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 519 transitions. [2023-02-15 22:05:01,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:05:01,794 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:01,794 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:01,808 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-15 22:05:02,000 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-15 22:05:02,001 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-15 22:05:02,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:02,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1895308392, now seen corresponding path program 1 times [2023-02-15 22:05:02,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:02,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64946078] [2023-02-15 22:05:02,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:02,002 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-15 22:05:02,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:02,003 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-15 22:05:02,005 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-15 22:05:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:02,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:05:02,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:02,102 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-15 22:05:02,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:02,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:02,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64946078] [2023-02-15 22:05:02,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64946078] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:02,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:02,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:05:02,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317667549] [2023-02-15 22:05:02,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:02,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:05:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:02,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:05:02,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:05:02,104 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-15 22:05:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:02,152 INFO L93 Difference]: Finished difference Result 351 states and 397 transitions. [2023-02-15 22:05:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:05:02,153 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-15 22:05:02,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:02,154 INFO L225 Difference]: With dead ends: 351 [2023-02-15 22:05:02,154 INFO L226 Difference]: Without dead ends: 351 [2023-02-15 22:05:02,154 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-15 22:05:02,155 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:02,155 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.0s Time] [2023-02-15 22:05:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-02-15 22:05:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 345. [2023-02-15 22:05:02,160 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-15 22:05:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 387 transitions. [2023-02-15 22:05:02,161 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 387 transitions. Word has length 17 [2023-02-15 22:05:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:02,161 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 387 transitions. [2023-02-15 22:05:02,161 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-15 22:05:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 387 transitions. [2023-02-15 22:05:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:05:02,161 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:02,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:02,182 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-15 22:05:02,368 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-15 22:05:02,369 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-15 22:05:02,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:02,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2106255897, now seen corresponding path program 1 times [2023-02-15 22:05:02,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:02,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977358923] [2023-02-15 22:05:02,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:02,370 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-15 22:05:02,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:02,371 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-15 22:05:02,373 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-15 22:05:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:02,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:05:02,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:02,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-15 22:05:02,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:02,498 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-15 22:05:02,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:02,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977358923] [2023-02-15 22:05:02,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977358923] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:05:02,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:05:02,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-15 22:05:02,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041367507] [2023-02-15 22:05:02,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:05:02,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:05:02,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:02,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:05:02,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:05:02,500 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-15 22:05:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:02,550 INFO L93 Difference]: Finished difference Result 344 states and 386 transitions. [2023-02-15 22:05:02,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:05:02,550 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-15 22:05:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:02,551 INFO L225 Difference]: With dead ends: 344 [2023-02-15 22:05:02,551 INFO L226 Difference]: Without dead ends: 344 [2023-02-15 22:05:02,552 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-15 22:05:02,552 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-15 22:05:02,552 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-15 22:05:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-02-15 22:05:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2023-02-15 22:05:02,556 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-15 22:05:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 386 transitions. [2023-02-15 22:05:02,557 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 386 transitions. Word has length 17 [2023-02-15 22:05:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:02,558 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 386 transitions. [2023-02-15 22:05:02,558 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-15 22:05:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 386 transitions. [2023-02-15 22:05:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:05:02,558 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:02,559 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:02,578 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-15 22:05:02,778 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-15 22:05:02,779 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-15 22:05:02,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:02,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2106256148, now seen corresponding path program 1 times [2023-02-15 22:05:02,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:02,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145521637] [2023-02-15 22:05:02,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:02,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:02,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:02,781 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-15 22:05:02,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 22:05:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:02,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:05:02,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:02,896 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-15 22:05:02,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:02,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:02,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145521637] [2023-02-15 22:05:02,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145521637] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:02,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:02,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:05:02,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607614341] [2023-02-15 22:05:02,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:02,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:05:02,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:02,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:05:02,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:05:02,898 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-15 22:05:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:02,942 INFO L93 Difference]: Finished difference Result 388 states and 436 transitions. [2023-02-15 22:05:02,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:05:02,943 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-15 22:05:02,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:02,944 INFO L225 Difference]: With dead ends: 388 [2023-02-15 22:05:02,944 INFO L226 Difference]: Without dead ends: 388 [2023-02-15 22:05:02,944 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-15 22:05:02,945 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-15 22:05:02,945 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-15 22:05:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-02-15 22:05:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 346. [2023-02-15 22:05:02,950 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-15 22:05:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 388 transitions. [2023-02-15 22:05:02,951 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 388 transitions. Word has length 17 [2023-02-15 22:05:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:02,951 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 388 transitions. [2023-02-15 22:05:02,951 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-15 22:05:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 388 transitions. [2023-02-15 22:05:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:05:02,952 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:02,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:02,973 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-15 22:05:03,158 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-15 22:05:03,159 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-15 22:05:03,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:03,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2134885299, now seen corresponding path program 1 times [2023-02-15 22:05:03,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:03,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856928969] [2023-02-15 22:05:03,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:03,160 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-15 22:05:03,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:03,179 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-15 22:05:03,224 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-15 22:05:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:03,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:05:03,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:03,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 22:05:03,300 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-15 22:05:03,345 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:05:03,345 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-15 22:05:03,353 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-15 22:05:03,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:03,446 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-15 22:05:03,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:03,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856928969] [2023-02-15 22:05:03,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856928969] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:05:03,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:05:03,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-15 22:05:03,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928914128] [2023-02-15 22:05:03,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:05:03,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:05:03,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:03,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:05:03,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-15 22:05:03,448 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-15 22:05:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:04,690 INFO L93 Difference]: Finished difference Result 381 states and 424 transitions. [2023-02-15 22:05:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:05:04,691 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-15 22:05:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:04,692 INFO L225 Difference]: With dead ends: 381 [2023-02-15 22:05:04,692 INFO L226 Difference]: Without dead ends: 381 [2023-02-15 22:05:04,692 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-15 22:05:04,692 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 233 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:04,693 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.2s Time] [2023-02-15 22:05:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-02-15 22:05:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 348. [2023-02-15 22:05:04,697 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-15 22:05:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 391 transitions. [2023-02-15 22:05:04,698 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 391 transitions. Word has length 17 [2023-02-15 22:05:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:04,698 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 391 transitions. [2023-02-15 22:05:04,698 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-15 22:05:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 391 transitions. [2023-02-15 22:05:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:05:04,699 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:04,699 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:04,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-02-15 22:05:04,899 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-15 22:05:04,900 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-15 22:05:04,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:04,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2134885298, now seen corresponding path program 1 times [2023-02-15 22:05:04,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:04,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263503931] [2023-02-15 22:05:04,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:04,900 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-15 22:05:04,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:04,903 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-15 22:05:04,906 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-15 22:05:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:05,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:05:05,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:05,018 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-15 22:05:05,022 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-15 22:05:05,094 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-15 22:05:05,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:05:05,108 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-15 22:05:05,116 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:05:05,116 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-15 22:05:05,137 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-15 22:05:05,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:05,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:05,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263503931] [2023-02-15 22:05:05,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263503931] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:05,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1685308650] [2023-02-15 22:05:05,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:05,678 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:05:05,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:05:05,694 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-15 22:05:05,706 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-15 22:05:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:05,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:05:05,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:05,814 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-15 22:05:05,819 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-15 22:05:05,911 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-15 22:05:05,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:05:05,926 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-15 22:05:05,936 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:05:05,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:05:05,944 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-15 22:05:05,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:06,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1685308650] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:06,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:05:06,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-15 22:05:06,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480649460] [2023-02-15 22:05:06,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:05:06,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:05:06,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:06,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:05:06,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=71, Unknown=2, NotChecked=34, Total=132 [2023-02-15 22:05:06,063 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-15 22:05:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:08,157 INFO L93 Difference]: Finished difference Result 698 states and 811 transitions. [2023-02-15 22:05:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:05:08,158 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-15 22:05:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:08,160 INFO L225 Difference]: With dead ends: 698 [2023-02-15 22:05:08,160 INFO L226 Difference]: Without dead ends: 698 [2023-02-15 22:05:08,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=105, Unknown=2, NotChecked=42, Total=182 [2023-02-15 22:05:08,161 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:08,161 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.0s Time] [2023-02-15 22:05:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2023-02-15 22:05:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 360. [2023-02-15 22:05:08,169 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-15 22:05:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 417 transitions. [2023-02-15 22:05:08,170 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 417 transitions. Word has length 17 [2023-02-15 22:05:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:08,170 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 417 transitions. [2023-02-15 22:05:08,171 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-15 22:05:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 417 transitions. [2023-02-15 22:05:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 22:05:08,172 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:08,172 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:08,179 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-15 22:05:08,402 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-15 22:05:08,579 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-15 22:05:08,579 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-15 22:05:08,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:08,580 INFO L85 PathProgramCache]: Analyzing trace with hash -869422937, now seen corresponding path program 1 times [2023-02-15 22:05:08,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:08,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501615131] [2023-02-15 22:05:08,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:08,580 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-15 22:05:08,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:08,581 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-15 22:05:08,582 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-15 22:05:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:08,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:05:08,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:08,757 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-15 22:05:08,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:08,818 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-15 22:05:08,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:08,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501615131] [2023-02-15 22:05:08,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501615131] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:05:08,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:05:08,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-15 22:05:08,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671595540] [2023-02-15 22:05:08,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:05:08,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:05:08,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:08,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:05:08,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:05:08,820 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-15 22:05:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:09,145 INFO L93 Difference]: Finished difference Result 363 states and 418 transitions. [2023-02-15 22:05:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:05:09,146 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-15 22:05:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:09,147 INFO L225 Difference]: With dead ends: 363 [2023-02-15 22:05:09,147 INFO L226 Difference]: Without dead ends: 363 [2023-02-15 22:05:09,147 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-15 22:05:09,148 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-15 22:05:09,148 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-15 22:05:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-02-15 22:05:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2023-02-15 22:05:09,152 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-15 22:05:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 415 transitions. [2023-02-15 22:05:09,153 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 415 transitions. Word has length 18 [2023-02-15 22:05:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:09,153 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 415 transitions. [2023-02-15 22:05:09,153 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-15 22:05:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 415 transitions. [2023-02-15 22:05:09,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 22:05:09,153 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:09,153 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-15 22:05:09,160 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 (13)] Ended with exit code 0 [2023-02-15 22:05:09,359 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-15 22:05:09,360 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-15 22:05:09,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:09,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1883109288, now seen corresponding path program 1 times [2023-02-15 22:05:09,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:09,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374975923] [2023-02-15 22:05:09,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:09,360 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-15 22:05:09,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:09,361 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-15 22:05:09,362 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-15 22:05:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:09,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:05:09,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:09,446 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-15 22:05:09,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:09,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:09,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374975923] [2023-02-15 22:05:09,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374975923] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:09,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:09,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:05:09,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11557280] [2023-02-15 22:05:09,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:09,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:05:09,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:09,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:05:09,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:05:09,448 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-15 22:05:09,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:09,967 INFO L93 Difference]: Finished difference Result 362 states and 417 transitions. [2023-02-15 22:05:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:05:09,968 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-15 22:05:09,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:09,969 INFO L225 Difference]: With dead ends: 362 [2023-02-15 22:05:09,969 INFO L226 Difference]: Without dead ends: 349 [2023-02-15 22:05:09,969 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-15 22:05:09,969 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 41 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:09,970 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.5s Time] [2023-02-15 22:05:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-02-15 22:05:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2023-02-15 22:05:09,974 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-15 22:05:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 404 transitions. [2023-02-15 22:05:09,975 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 404 transitions. Word has length 18 [2023-02-15 22:05:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:09,975 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 404 transitions. [2023-02-15 22:05:09,976 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-15 22:05:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 404 transitions. [2023-02-15 22:05:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 22:05:09,976 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:09,976 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-15 22:05:09,983 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-15 22:05:10,176 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-15 22:05:10,177 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-15 22:05:10,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:10,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1969475052, now seen corresponding path program 1 times [2023-02-15 22:05:10,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:10,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940488179] [2023-02-15 22:05:10,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:10,177 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-15 22:05:10,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:10,178 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-15 22:05:10,180 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-15 22:05:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:10,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:05:10,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:10,341 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:05:10,341 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-15 22:05:10,403 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-15 22:05:10,408 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-15 22:05:10,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:10,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:10,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940488179] [2023-02-15 22:05:10,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940488179] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:10,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [937979989] [2023-02-15 22:05:10,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:10,449 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:05:10,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:05:10,450 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-15 22:05:10,451 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-15 22:05:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:10,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:05:10,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:10,553 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-15 22:05:10,589 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:05:10,589 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-15 22:05:10,648 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-15 22:05:10,657 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-15 22:05:10,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:10,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [937979989] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:10,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:05:10,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-02-15 22:05:10,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291486356] [2023-02-15 22:05:10,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:05:10,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:05:10,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:10,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:05:10,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:05:10,713 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-15 22:05:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:11,965 INFO L93 Difference]: Finished difference Result 426 states and 479 transitions. [2023-02-15 22:05:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:05:11,966 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-15 22:05:11,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:11,967 INFO L225 Difference]: With dead ends: 426 [2023-02-15 22:05:11,967 INFO L226 Difference]: Without dead ends: 426 [2023-02-15 22:05:11,967 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-15 22:05:11,967 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 440 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 70 mSolverCounterUnsat, 1 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, 742 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:11,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 838 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 742 Invalid, 1 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 22:05:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2023-02-15 22:05:11,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 351. [2023-02-15 22:05:11,972 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-15 22:05:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 407 transitions. [2023-02-15 22:05:11,973 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 407 transitions. Word has length 21 [2023-02-15 22:05:11,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:11,974 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 407 transitions. [2023-02-15 22:05:11,974 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-15 22:05:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 407 transitions. [2023-02-15 22:05:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 22:05:11,975 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:11,975 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-15 22:05:11,988 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-15 22:05:12,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:12,385 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-15 22:05:12,386 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-15 22:05:12,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:12,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1969475053, now seen corresponding path program 1 times [2023-02-15 22:05:12,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:12,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411610407] [2023-02-15 22:05:12,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:12,387 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-15 22:05:12,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:12,390 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-15 22:05:12,391 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-15 22:05:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:12,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:05:12,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:14,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:05:14,584 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-15 22:05:16,692 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-15 22:05:16,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:21,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:21,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411610407] [2023-02-15 22:05:21,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411610407] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:21,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1114205857] [2023-02-15 22:05:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:21,258 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:05:21,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:05:21,261 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-15 22:05:21,279 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-15 22:05:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:21,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:05:21,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:21,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 22:05:23,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:05:23,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 12 treesize of output 14 [2023-02-15 22:05:23,549 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-15 22:05:23,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:25,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1114205857] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:25,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:05:25,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-02-15 22:05:25,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517281688] [2023-02-15 22:05:25,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:05:25,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:05:25,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:25,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:05:25,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=60, Unknown=3, NotChecked=0, Total=90 [2023-02-15 22:05:25,755 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-15 22:05:29,975 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-15 22:05:34,023 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-15 22:05:36,029 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-15 22:05:38,037 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-15 22:05:40,050 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-15 22:05:42,056 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-15 22:05:44,062 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-15 22:05:52,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:05:54,645 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-15 22:05:56,664 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-15 22:05:59,515 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-15 22:06:01,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:01,540 INFO L93 Difference]: Finished difference Result 419 states and 472 transitions. [2023-02-15 22:06:01,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:06:01,541 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-15 22:06:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:01,547 INFO L225 Difference]: With dead ends: 419 [2023-02-15 22:06:01,547 INFO L226 Difference]: Without dead ends: 419 [2023-02-15 22:06:01,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=85, Invalid=149, Unknown=6, NotChecked=0, Total=240 [2023-02-15 22:06:01,547 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 527 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 65 mSolverCounterUnsat, 155 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 155 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:01,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 436 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 564 Invalid, 155 Unknown, 0 Unchecked, 25.6s Time] [2023-02-15 22:06:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-02-15 22:06:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 350. [2023-02-15 22:06:01,552 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-15 22:06:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 405 transitions. [2023-02-15 22:06:01,553 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 405 transitions. Word has length 21 [2023-02-15 22:06:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:01,553 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 405 transitions. [2023-02-15 22:06:01,553 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-15 22:06:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 405 transitions. [2023-02-15 22:06:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 22:06:01,554 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:01,554 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-15 22:06:01,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-02-15 22:06:01,762 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-15 22:06:01,962 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-15 22:06:01,962 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-15 22:06:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1415040467, now seen corresponding path program 1 times [2023-02-15 22:06:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:01,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664489143] [2023-02-15 22:06:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:01,963 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-15 22:06:01,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:01,964 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-15 22:06:01,965 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-15 22:06:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:02,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:06:02,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:02,084 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-15 22:06:02,100 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-15 22:06:02,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:06:02,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:02,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664489143] [2023-02-15 22:06:02,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664489143] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:06:02,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:06:02,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:06:02,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312095390] [2023-02-15 22:06:02,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:06:02,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:06:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:02,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:06:02,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:06:02,102 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-15 22:06:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:02,713 INFO L93 Difference]: Finished difference Result 390 states and 447 transitions. [2023-02-15 22:06:02,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:06:02,714 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-15 22:06:02,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:02,715 INFO L225 Difference]: With dead ends: 390 [2023-02-15 22:06:02,715 INFO L226 Difference]: Without dead ends: 390 [2023-02-15 22:06:02,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:06:02,716 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-15 22:06:02,716 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-15 22:06:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-02-15 22:06:02,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 352. [2023-02-15 22:06:02,728 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-15 22:06:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 408 transitions. [2023-02-15 22:06:02,733 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 408 transitions. Word has length 23 [2023-02-15 22:06:02,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:02,733 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 408 transitions. [2023-02-15 22:06:02,733 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-15 22:06:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 408 transitions. [2023-02-15 22:06:02,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 22:06:02,734 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:02,734 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-15 22:06:02,750 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-15 22:06:02,941 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-15 22:06:02,941 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-15 22:06:02,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1415040466, now seen corresponding path program 1 times [2023-02-15 22:06:02,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:02,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544592036] [2023-02-15 22:06:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:02,942 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-15 22:06:02,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:02,943 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-15 22:06:02,982 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-15 22:06:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:03,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 22:06:03,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:03,155 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-15 22:06:03,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:06:03,188 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-15 22:06:03,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:06:03,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:03,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544592036] [2023-02-15 22:06:03,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544592036] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:06:03,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:06:03,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:06:03,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737255208] [2023-02-15 22:06:03,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:06:03,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:06:03,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:03,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:06:03,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:06:03,189 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-15 22:06:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:03,868 INFO L93 Difference]: Finished difference Result 375 states and 432 transitions. [2023-02-15 22:06:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:06:03,881 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-15 22:06:03,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:03,882 INFO L225 Difference]: With dead ends: 375 [2023-02-15 22:06:03,882 INFO L226 Difference]: Without dead ends: 375 [2023-02-15 22:06:03,882 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-15 22:06:03,883 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 41 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:03,883 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.6s Time] [2023-02-15 22:06:03,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-02-15 22:06:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 352. [2023-02-15 22:06:03,887 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-15 22:06:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 407 transitions. [2023-02-15 22:06:03,888 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 407 transitions. Word has length 23 [2023-02-15 22:06:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:03,888 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 407 transitions. [2023-02-15 22:06:03,888 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-15 22:06:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 407 transitions. [2023-02-15 22:06:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:06:03,888 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:03,888 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-15 22:06:03,897 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-15 22:06:04,090 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-15 22:06:04,091 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-15 22:06:04,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash -412937067, now seen corresponding path program 1 times [2023-02-15 22:06:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:04,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634270437] [2023-02-15 22:06:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:04,091 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-15 22:06:04,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:04,092 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-15 22:06:04,095 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-15 22:06:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:04,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:06:04,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:04,191 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-15 22:06:04,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:04,224 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-15 22:06:04,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:04,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634270437] [2023-02-15 22:06:04,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634270437] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:06:04,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:06:04,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-15 22:06:04,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938451133] [2023-02-15 22:06:04,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:06:04,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:06:04,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:04,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:06:04,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:06:04,241 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-15 22:06:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:04,306 INFO L93 Difference]: Finished difference Result 351 states and 406 transitions. [2023-02-15 22:06:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:06:04,307 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-15 22:06:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:04,308 INFO L225 Difference]: With dead ends: 351 [2023-02-15 22:06:04,308 INFO L226 Difference]: Without dead ends: 351 [2023-02-15 22:06:04,308 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-15 22:06:04,308 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-15 22:06:04,309 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-15 22:06:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-02-15 22:06:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2023-02-15 22:06:04,312 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-15 22:06:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 406 transitions. [2023-02-15 22:06:04,313 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 406 transitions. Word has length 25 [2023-02-15 22:06:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:04,313 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 406 transitions. [2023-02-15 22:06:04,313 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-15 22:06:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 406 transitions. [2023-02-15 22:06:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:06:04,314 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:04,314 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-15 22:06:04,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-15 22:06:04,514 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-15 22:06:04,515 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-15 22:06:04,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash -412937301, now seen corresponding path program 1 times [2023-02-15 22:06:04,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:04,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990572633] [2023-02-15 22:06:04,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:04,515 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-15 22:06:04,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:04,516 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-15 22:06:04,519 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-15 22:06:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:04,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:06:04,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:04,650 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-15 22:06:04,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:06:04,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:04,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990572633] [2023-02-15 22:06:04,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990572633] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:06:04,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:06:04,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:06:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496777115] [2023-02-15 22:06:04,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:06:04,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:06:04,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:04,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:06:04,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:06:04,651 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-15 22:06:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:04,694 INFO L93 Difference]: Finished difference Result 392 states and 444 transitions. [2023-02-15 22:06:04,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:06:04,694 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-15 22:06:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:04,695 INFO L225 Difference]: With dead ends: 392 [2023-02-15 22:06:04,695 INFO L226 Difference]: Without dead ends: 392 [2023-02-15 22:06:04,695 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-15 22:06:04,696 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-15 22:06:04,696 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-15 22:06:04,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-02-15 22:06:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 349. [2023-02-15 22:06:04,700 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-15 22:06:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 399 transitions. [2023-02-15 22:06:04,700 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 399 transitions. Word has length 25 [2023-02-15 22:06:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:04,701 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 399 transitions. [2023-02-15 22:06:04,701 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-15 22:06:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 399 transitions. [2023-02-15 22:06:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:06:04,701 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:04,701 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-15 22:06:04,707 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-15 22:06:04,907 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-15 22:06:04,908 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-15 22:06:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash -441566452, now seen corresponding path program 1 times [2023-02-15 22:06:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:04,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942914980] [2023-02-15 22:06:04,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:04,908 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-15 22:06:04,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:04,909 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-15 22:06:04,910 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-15 22:06:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:04,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:06:04,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:04,996 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-15 22:06:05,039 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-15 22:06:05,054 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:06:05,054 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-15 22:06:05,069 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-15 22:06:05,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:05,190 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-15 22:06:05,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:05,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942914980] [2023-02-15 22:06:05,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942914980] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:06:05,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:06:05,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-15 22:06:05,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963866662] [2023-02-15 22:06:05,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:06:05,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:06:05,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:05,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:06:05,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-15 22:06:05,191 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-15 22:06:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:06,366 INFO L93 Difference]: Finished difference Result 379 states and 425 transitions. [2023-02-15 22:06:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:06:06,367 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-15 22:06:06,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:06,368 INFO L225 Difference]: With dead ends: 379 [2023-02-15 22:06:06,368 INFO L226 Difference]: Without dead ends: 379 [2023-02-15 22:06:06,368 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-15 22:06:06,368 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 183 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:06,368 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.1s Time] [2023-02-15 22:06:06,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-02-15 22:06:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 351. [2023-02-15 22:06:06,383 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-15 22:06:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 402 transitions. [2023-02-15 22:06:06,384 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 402 transitions. Word has length 25 [2023-02-15 22:06:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:06,385 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 402 transitions. [2023-02-15 22:06:06,385 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-15 22:06:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 402 transitions. [2023-02-15 22:06:06,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:06:06,385 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:06,385 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-15 22:06:06,395 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 (23)] Ended with exit code 0 [2023-02-15 22:06:06,593 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-15 22:06:06,593 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-15 22:06:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash -441566451, now seen corresponding path program 1 times [2023-02-15 22:06:06,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:06,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140160467] [2023-02-15 22:06:06,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:06,594 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-15 22:06:06,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:06,596 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-15 22:06:06,610 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-15 22:06:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:06,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 22:06:06,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:06,698 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-15 22:06:06,789 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-15 22:06:06,808 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:06:06,808 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-15 22:06:06,831 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-15 22:06:06,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:07,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:07,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140160467] [2023-02-15 22:06:07,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140160467] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:06:07,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [217892304] [2023-02-15 22:06:07,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:07,060 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:06:07,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:06:07,061 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-15 22:06:07,080 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-15 22:06:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:07,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:06:07,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:07,202 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-15 22:06:07,208 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-15 22:06:07,349 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-15 22:06:07,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:06:07,363 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-15 22:06:07,372 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:06:07,372 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-15 22:06:07,386 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-15 22:06:07,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:11,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [217892304] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:06:11,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:06:11,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-15 22:06:11,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655227625] [2023-02-15 22:06:11,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:06:11,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:06:11,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:11,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:06:11,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=171, Unknown=4, NotChecked=54, Total=272 [2023-02-15 22:06:11,575 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-15 22:06:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:14,977 INFO L93 Difference]: Finished difference Result 681 states and 789 transitions. [2023-02-15 22:06:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:06:14,977 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-15 22:06:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:14,979 INFO L225 Difference]: With dead ends: 681 [2023-02-15 22:06:14,979 INFO L226 Difference]: Without dead ends: 681 [2023-02-15 22:06:14,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=54, Invalid=222, Unknown=4, NotChecked=62, Total=342 [2023-02-15 22:06:14,980 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 442 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s 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, 3.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:14,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1868 Invalid, 3334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2215 Invalid, 0 Unknown, 1054 Unchecked, 3.3s Time] [2023-02-15 22:06:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-02-15 22:06:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 350. [2023-02-15 22:06:14,985 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-15 22:06:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 401 transitions. [2023-02-15 22:06:14,996 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 401 transitions. Word has length 25 [2023-02-15 22:06:14,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:14,996 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 401 transitions. [2023-02-15 22:06:14,996 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-15 22:06:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 401 transitions. [2023-02-15 22:06:14,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:06:14,997 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:14,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] [2023-02-15 22:06:15,004 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-15 22:06:15,201 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-15 22:06:15,397 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-15 22:06:15,398 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-15 22:06:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:15,398 INFO L85 PathProgramCache]: Analyzing trace with hash 83853234, now seen corresponding path program 1 times [2023-02-15 22:06:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:15,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399764244] [2023-02-15 22:06:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:15,399 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-15 22:06:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:15,400 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-15 22:06:15,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-15 22:06:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:15,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:06:15,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:15,768 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-15 22:06:15,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:15,866 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-15 22:06:15,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:15,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399764244] [2023-02-15 22:06:15,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399764244] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:06:15,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:06:15,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-15 22:06:15,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744524268] [2023-02-15 22:06:15,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:06:15,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:06:15,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:15,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:06:15,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:06:15,868 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-15 22:06:16,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:16,421 INFO L93 Difference]: Finished difference Result 349 states and 399 transitions. [2023-02-15 22:06:16,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:06:16,422 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-15 22:06:16,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:16,423 INFO L225 Difference]: With dead ends: 349 [2023-02-15 22:06:16,423 INFO L226 Difference]: Without dead ends: 349 [2023-02-15 22:06:16,423 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-15 22:06:16,423 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 578 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:16,424 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.5s Time] [2023-02-15 22:06:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-02-15 22:06:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2023-02-15 22:06:16,427 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-15 22:06:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 399 transitions. [2023-02-15 22:06:16,428 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 399 transitions. Word has length 26 [2023-02-15 22:06:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:16,428 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 399 transitions. [2023-02-15 22:06:16,428 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-15 22:06:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 399 transitions. [2023-02-15 22:06:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:06:16,428 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:16,431 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-15 22:06:16,439 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-15 22:06:16,637 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-15 22:06:16,637 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-15 22:06:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:16,638 INFO L85 PathProgramCache]: Analyzing trace with hash -366162574, now seen corresponding path program 1 times [2023-02-15 22:06:16,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:16,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813569753] [2023-02-15 22:06:16,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:16,638 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-15 22:06:16,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:16,639 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-15 22:06:16,641 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-15 22:06:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:16,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 22:06:16,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:16,907 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-15 22:06:16,912 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-15 22:06:16,967 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-15 22:06:16,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:06:16,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:16,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813569753] [2023-02-15 22:06:16,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813569753] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:06:16,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:06:16,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:06:16,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870672631] [2023-02-15 22:06:16,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:06:16,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:06:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:16,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:06:16,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:06:16,968 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-15 22:06:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:17,356 INFO L93 Difference]: Finished difference Result 355 states and 404 transitions. [2023-02-15 22:06:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:06:17,357 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-15 22:06:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:17,358 INFO L225 Difference]: With dead ends: 355 [2023-02-15 22:06:17,358 INFO L226 Difference]: Without dead ends: 355 [2023-02-15 22:06:17,358 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-15 22:06:17,359 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-15 22:06:17,359 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-15 22:06:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-02-15 22:06:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2023-02-15 22:06:17,363 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-15 22:06:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 401 transitions. [2023-02-15 22:06:17,366 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 401 transitions. Word has length 26 [2023-02-15 22:06:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:17,366 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 401 transitions. [2023-02-15 22:06:17,366 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-15 22:06:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 401 transitions. [2023-02-15 22:06:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 22:06:17,367 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:17,367 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-15 22:06:17,377 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-15 22:06:17,574 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-15 22:06:17,574 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-15 22:06:17,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash 305064464, now seen corresponding path program 1 times [2023-02-15 22:06:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:17,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348741351] [2023-02-15 22:06:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:17,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:17,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:17,578 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-15 22:06:17,580 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-15 22:06:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:17,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:06:17,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:17,808 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-15 22:06:17,854 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-15 22:06:17,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:18,005 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-15 22:06:18,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:18,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348741351] [2023-02-15 22:06:18,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348741351] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:06:18,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [945829253] [2023-02-15 22:06:18,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:18,007 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:06:18,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:06:18,008 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-15 22:06:18,009 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-15 22:06:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:18,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:06:18,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:18,328 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-15 22:06:18,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:18,412 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-15 22:06:18,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [945829253] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:06:18,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:06:18,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-02-15 22:06:18,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118831457] [2023-02-15 22:06:18,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:06:18,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:06:18,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:18,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:06:18,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=126, Unknown=3, NotChecked=72, Total=240 [2023-02-15 22:06:18,415 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-15 22:06:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:20,551 INFO L93 Difference]: Finished difference Result 363 states and 412 transitions. [2023-02-15 22:06:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:06:20,552 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-15 22:06:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:20,553 INFO L225 Difference]: With dead ends: 363 [2023-02-15 22:06:20,553 INFO L226 Difference]: Without dead ends: 347 [2023-02-15 22:06:20,553 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-15 22:06:20,555 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 363 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:20,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1196 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1075 Invalid, 0 Unknown, 345 Unchecked, 2.0s Time] [2023-02-15 22:06:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-02-15 22:06:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2023-02-15 22:06:20,559 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-15 22:06:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 394 transitions. [2023-02-15 22:06:20,560 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 394 transitions. Word has length 28 [2023-02-15 22:06:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:20,560 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 394 transitions. [2023-02-15 22:06:20,560 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-15 22:06:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 394 transitions. [2023-02-15 22:06:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 22:06:20,561 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:20,561 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-15 22:06:20,584 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-15 22:06:20,791 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 (28)] Ended with exit code 0 [2023-02-15 22:06:20,990 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-15 22:06:20,991 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-15 22:06:20,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1048245233, now seen corresponding path program 1 times [2023-02-15 22:06:20,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:20,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490626900] [2023-02-15 22:06:20,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:20,992 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-15 22:06:20,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:20,993 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-15 22:06:20,994 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-15 22:06:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:21,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:06:21,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:21,083 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-15 22:06:21,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:06:21,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:21,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490626900] [2023-02-15 22:06:21,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490626900] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:06:21,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:06:21,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:06:21,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087178551] [2023-02-15 22:06:21,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:06:21,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:06:21,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:21,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:06:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:06:21,086 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-15 22:06:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:21,128 INFO L93 Difference]: Finished difference Result 336 states and 384 transitions. [2023-02-15 22:06:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:06:21,128 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-15 22:06:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:21,130 INFO L225 Difference]: With dead ends: 336 [2023-02-15 22:06:21,130 INFO L226 Difference]: Without dead ends: 336 [2023-02-15 22:06:21,130 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-15 22:06:21,139 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 245 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:21,139 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.0s Time] [2023-02-15 22:06:21,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-02-15 22:06:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2023-02-15 22:06:21,159 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-15 22:06:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 384 transitions. [2023-02-15 22:06:21,160 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 384 transitions. Word has length 28 [2023-02-15 22:06:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:21,160 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 384 transitions. [2023-02-15 22:06:21,161 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-15 22:06:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 384 transitions. [2023-02-15 22:06:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 22:06:21,161 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:21,161 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-15 22:06:21,168 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-15 22:06:21,367 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-15 22:06:21,368 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-15 22:06:21,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:21,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1975256279, now seen corresponding path program 1 times [2023-02-15 22:06:21,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:21,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275385966] [2023-02-15 22:06:21,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:21,368 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-15 22:06:21,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:21,369 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-15 22:06:21,371 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-15 22:06:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:21,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:06:21,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:21,451 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-15 22:06:21,523 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:06:21,523 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-15 22:06:21,597 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-15 22:06:21,603 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-15 22:06:21,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:21,892 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-15 22:06:21,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:21,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275385966] [2023-02-15 22:06:21,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275385966] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:06:21,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:06:21,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-02-15 22:06:21,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383185323] [2023-02-15 22:06:21,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:06:21,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 22:06:21,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:21,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 22:06:21,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:06:21,895 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-15 22:06:24,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:24,122 INFO L93 Difference]: Finished difference Result 389 states and 435 transitions. [2023-02-15 22:06:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:06:24,123 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-15 22:06:24,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:24,124 INFO L225 Difference]: With dead ends: 389 [2023-02-15 22:06:24,124 INFO L226 Difference]: Without dead ends: 389 [2023-02-15 22:06:24,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:06:24,125 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 599 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:24,125 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.2s Time] [2023-02-15 22:06:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-02-15 22:06:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 339. [2023-02-15 22:06:24,128 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-15 22:06:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 387 transitions. [2023-02-15 22:06:24,129 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 387 transitions. Word has length 30 [2023-02-15 22:06:24,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:24,129 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 387 transitions. [2023-02-15 22:06:24,129 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-15 22:06:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 387 transitions. [2023-02-15 22:06:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 22:06:24,129 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:24,129 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-15 22:06:24,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 (31)] Forceful destruction successful, exit code 0 [2023-02-15 22:06:24,329 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-15 22:06:24,329 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-15 22:06:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash -154246822, now seen corresponding path program 1 times [2023-02-15 22:06:24,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:24,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151795265] [2023-02-15 22:06:24,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:24,330 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-15 22:06:24,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:24,331 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-15 22:06:24,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 (32)] Waiting until timeout for monitored process [2023-02-15 22:06:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:24,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 22:06:24,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:24,474 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:06:24,474 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-15 22:06:24,554 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:06:24,554 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-15 22:06:24,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 22:06:24,699 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-15 22:06:24,705 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-15 22:06:24,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:24,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:24,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151795265] [2023-02-15 22:06:24,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151795265] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:06:24,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1815779037] [2023-02-15 22:06:24,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:24,791 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:06:24,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:06:24,792 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-15 22:06:24,793 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-15 22:06:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:24,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 22:06:24,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:24,933 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-15 22:06:24,996 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:06:24,996 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-15 22:06:25,103 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:06:25,103 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-15 22:06:25,378 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-15 22:06:25,533 INFO L321 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2023-02-15 22:06:25,533 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 26 treesize of output 39 [2023-02-15 22:06:25,578 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-15 22:06:25,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:25,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1815779037] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:06:25,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:06:25,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 13 [2023-02-15 22:06:25,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231769563] [2023-02-15 22:06:25,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:06:25,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 22:06:25,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:25,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 22:06:25,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:06:25,778 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-15 22:06:27,815 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-15 22:06:31,841 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-15 22:06:33,849 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-15 22:06:35,889 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-15 22:06:37,927 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-15 22:06:39,929 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-15 22:06:41,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:43,209 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-15 22:06:46,060 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-15 22:06:47,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:49,312 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-15 22:06:51,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:53,849 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-15 22:06:56,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:58,839 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-15 22:07:00,859 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-15 22:07:02,977 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-15 22:07:05,402 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-15 22:07:07,609 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-15 22:07:09,677 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-15 22:07:11,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:07:13,790 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-15 22:07:15,848 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-15 22:07:18,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:07:20,973 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-15 22:07:23,851 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-15 22:07:26,173 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-15 22:07:29,230 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-15 22:07:31,645 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-15 22:07:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:31,653 INFO L93 Difference]: Finished difference Result 457 states and 507 transitions. [2023-02-15 22:07:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:07:31,654 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-15 22:07:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:31,655 INFO L225 Difference]: With dead ends: 457 [2023-02-15 22:07:31,655 INFO L226 Difference]: Without dead ends: 457 [2023-02-15 22:07:31,655 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-15 22:07:31,655 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 786 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 142 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:31,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1302 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1236 Invalid, 27 Unknown, 0 Unchecked, 63.7s Time] [2023-02-15 22:07:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-02-15 22:07:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 341. [2023-02-15 22:07:31,659 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-15 22:07:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 389 transitions. [2023-02-15 22:07:31,660 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 389 transitions. Word has length 32 [2023-02-15 22:07:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:31,660 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 389 transitions. [2023-02-15 22:07:31,661 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-15 22:07:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 389 transitions. [2023-02-15 22:07:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:07:31,661 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:31,661 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-15 22:07:31,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-02-15 22:07:31,868 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-15 22:07:32,061 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-15 22:07:32,062 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-15 22:07:32,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:32,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1682263433, now seen corresponding path program 1 times [2023-02-15 22:07:32,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:32,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619373656] [2023-02-15 22:07:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:32,062 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-15 22:07:32,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:32,063 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-15 22:07:32,065 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-15 22:07:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:32,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:07:32,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:32,172 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-15 22:07:32,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:32,211 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-15 22:07:32,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:32,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619373656] [2023-02-15 22:07:32,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619373656] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:07:32,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:32,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-15 22:07:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577471024] [2023-02-15 22:07:32,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:32,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:07:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:32,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:07:32,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:07:32,212 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-15 22:07:32,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:32,256 INFO L93 Difference]: Finished difference Result 340 states and 388 transitions. [2023-02-15 22:07:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:07:32,257 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-15 22:07:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:32,258 INFO L225 Difference]: With dead ends: 340 [2023-02-15 22:07:32,258 INFO L226 Difference]: Without dead ends: 340 [2023-02-15 22:07:32,258 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-15 22:07:32,258 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-15 22:07:32,258 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-15 22:07:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-02-15 22:07:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2023-02-15 22:07:32,262 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-15 22:07:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 388 transitions. [2023-02-15 22:07:32,262 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 388 transitions. Word has length 33 [2023-02-15 22:07:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:32,263 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 388 transitions. [2023-02-15 22:07:32,263 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-15 22:07:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 388 transitions. [2023-02-15 22:07:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:07:32,263 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:32,263 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-15 22:07:32,275 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-15 22:07:32,464 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-15 22:07:32,464 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-15 22:07:32,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:32,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1653634066, now seen corresponding path program 1 times [2023-02-15 22:07:32,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:32,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196453180] [2023-02-15 22:07:32,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:32,465 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-15 22:07:32,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:32,466 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-15 22:07:32,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-02-15 22:07:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:32,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 22:07:32,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:32,576 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-15 22:07:32,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 22:07:32,689 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-15 22:07:32,735 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:07:32,735 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-15 22:07:32,759 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-15 22:07:32,812 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-15 22:07:32,851 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:07:32,851 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-15 22:07:32,858 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-15 22:07:32,906 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-15 22:07:32,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:32,922 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-15 22:07:32,932 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:32,932 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-15 22:07:32,959 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-15 22:07:32,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:35,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:35,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196453180] [2023-02-15 22:07:35,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196453180] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:35,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [942880482] [2023-02-15 22:07:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:35,202 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:07:35,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:07:35,203 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-15 22:07:35,204 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-15 22:07:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:35,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 22:07:35,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:35,377 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-15 22:07:35,383 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-15 22:07:35,477 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:35,477 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-15 22:07:35,484 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-15 22:07:35,556 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-15 22:07:35,595 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:07:35,595 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-15 22:07:35,600 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-15 22:07:35,647 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-15 22:07:35,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:35,660 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-15 22:07:35,669 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:35,669 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-15 22:07:35,681 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-15 22:07:35,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:37,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [942880482] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:37,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:37,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 14 [2023-02-15 22:07:37,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79692479] [2023-02-15 22:07:37,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:37,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 22:07:37,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:37,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 22:07:37,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=109, Unknown=6, NotChecked=120, Total=272 [2023-02-15 22:07:37,836 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-15 22:07:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:40,669 INFO L93 Difference]: Finished difference Result 361 states and 405 transitions. [2023-02-15 22:07:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:07:40,670 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-15 22:07:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:40,670 INFO L225 Difference]: With dead ends: 361 [2023-02-15 22:07:40,671 INFO L226 Difference]: Without dead ends: 361 [2023-02-15 22:07:40,671 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-15 22:07:40,672 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 442 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 50 mSolverCounterUnsat, 54 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 54 IncrementalHoareTripleChecker+Unknown, 1675 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:40,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 997 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1372 Invalid, 54 Unknown, 1675 Unchecked, 2.6s Time] [2023-02-15 22:07:40,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-02-15 22:07:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 331. [2023-02-15 22:07:40,692 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-15 22:07:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 375 transitions. [2023-02-15 22:07:40,693 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 375 transitions. Word has length 33 [2023-02-15 22:07:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:40,693 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 375 transitions. [2023-02-15 22:07:40,693 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-15 22:07:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 375 transitions. [2023-02-15 22:07:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 22:07:40,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:40,694 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-15 22:07:40,701 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-15 22:07:40,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2023-02-15 22:07:41,103 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-15 22:07:41,103 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-15 22:07:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:41,104 INFO L85 PathProgramCache]: Analyzing trace with hash 610559287, now seen corresponding path program 1 times [2023-02-15 22:07:41,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:41,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562641289] [2023-02-15 22:07:41,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:41,104 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-15 22:07:41,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:41,105 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-15 22:07:41,106 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-15 22:07:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:41,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:07:41,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:41,483 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-15 22:07:41,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:41,565 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-15 22:07:41,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:41,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562641289] [2023-02-15 22:07:41,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562641289] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:07:41,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:41,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-15 22:07:41,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351031300] [2023-02-15 22:07:41,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:41,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:07:41,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:41,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:07:41,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:07:41,566 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-15 22:07:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:42,182 INFO L93 Difference]: Finished difference Result 332 states and 376 transitions. [2023-02-15 22:07:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:07:42,183 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-15 22:07:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:42,183 INFO L225 Difference]: With dead ends: 332 [2023-02-15 22:07:42,184 INFO L226 Difference]: Without dead ends: 332 [2023-02-15 22:07:42,184 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-15 22:07:42,184 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 754 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:42,184 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.6s Time] [2023-02-15 22:07:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-02-15 22:07:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2023-02-15 22:07:42,187 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-15 22:07:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 374 transitions. [2023-02-15 22:07:42,188 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 374 transitions. Word has length 34 [2023-02-15 22:07:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:42,188 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 374 transitions. [2023-02-15 22:07:42,188 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-15 22:07:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 374 transitions. [2023-02-15 22:07:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 22:07:42,188 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:42,188 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-15 22:07:42,210 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-15 22:07:42,388 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-15 22:07:42,389 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-15 22:07:42,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2092671515, now seen corresponding path program 1 times [2023-02-15 22:07:42,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:42,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176053966] [2023-02-15 22:07:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:42,389 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-15 22:07:42,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:42,405 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-15 22:07:42,446 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-15 22:07:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:42,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:07:42,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:42,640 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:07:42,640 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-15 22:07:42,650 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-15 22:07:42,752 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-15 22:07:42,818 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-15 22:07:42,867 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-15 22:07:42,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:42,933 INFO L321 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2023-02-15 22:07:42,933 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-15 22:07:43,130 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-15 22:07:43,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:43,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176053966] [2023-02-15 22:07:43,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176053966] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:43,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:07:43,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 16 [2023-02-15 22:07:43,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289067892] [2023-02-15 22:07:43,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:43,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:07:43,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:43,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:07:43,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:07:43,132 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-15 22:07:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:44,420 INFO L93 Difference]: Finished difference Result 370 states and 416 transitions. [2023-02-15 22:07:44,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:07:44,422 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-15 22:07:44,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:44,423 INFO L225 Difference]: With dead ends: 370 [2023-02-15 22:07:44,423 INFO L226 Difference]: Without dead ends: 370 [2023-02-15 22:07:44,423 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-15 22:07:44,423 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 98 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:44,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1449 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 22:07:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-02-15 22:07:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 332. [2023-02-15 22:07:44,427 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-15 22:07:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 377 transitions. [2023-02-15 22:07:44,427 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 377 transitions. Word has length 34 [2023-02-15 22:07:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:44,428 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 377 transitions. [2023-02-15 22:07:44,428 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-15 22:07:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 377 transitions. [2023-02-15 22:07:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 22:07:44,428 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:44,428 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-15 22:07:44,449 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-15 22:07:44,628 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-15 22:07:44,628 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-15 22:07:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2092671516, now seen corresponding path program 1 times [2023-02-15 22:07:44,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:44,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326502645] [2023-02-15 22:07:44,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:44,629 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-15 22:07:44,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:44,631 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-15 22:07:44,635 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-15 22:07:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:44,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 22:07:44,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:45,029 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:07:45,029 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-15 22:07:45,039 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-15 22:07:45,064 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:07:45,064 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-15 22:07:45,073 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-15 22:07:45,333 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-15 22:07:45,450 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-15 22:07:45,455 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-15 22:07:45,498 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-15 22:07:45,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:45,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:07:45,615 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-15 22:07:45,756 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-15 22:07:46,350 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-15 22:07:46,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:46,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326502645] [2023-02-15 22:07:46,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326502645] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:46,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:07:46,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 16 [2023-02-15 22:07:46,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274409666] [2023-02-15 22:07:46,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:46,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:07:46,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:46,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:07:46,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:07:46,352 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-15 22:07:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:49,428 INFO L93 Difference]: Finished difference Result 370 states and 416 transitions. [2023-02-15 22:07:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:07:49,429 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-15 22:07:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:49,430 INFO L225 Difference]: With dead ends: 370 [2023-02-15 22:07:49,430 INFO L226 Difference]: Without dead ends: 370 [2023-02-15 22:07:49,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:07:49,431 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 69 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:49,431 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.8s Time] [2023-02-15 22:07:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-02-15 22:07:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 332. [2023-02-15 22:07:49,434 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-15 22:07:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 376 transitions. [2023-02-15 22:07:49,435 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 376 transitions. Word has length 34 [2023-02-15 22:07:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:49,435 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 376 transitions. [2023-02-15 22:07:49,435 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-15 22:07:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 376 transitions. [2023-02-15 22:07:49,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 22:07:49,435 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:49,435 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-15 22:07:49,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:49,635 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-15 22:07:49,636 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-15 22:07:49,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:49,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1747469131, now seen corresponding path program 1 times [2023-02-15 22:07:49,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:49,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988731157] [2023-02-15 22:07:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:49,636 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-15 22:07:49,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:49,637 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-15 22:07:49,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-02-15 22:07:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:49,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:07:49,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:49,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 7 [2023-02-15 22:07:49,776 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-15 22:07:49,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:49,858 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-15 22:07:49,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:49,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988731157] [2023-02-15 22:07:49,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988731157] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:07:49,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:49,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-02-15 22:07:49,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107299102] [2023-02-15 22:07:49,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:49,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:07:49,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:49,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:07:49,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:07:49,859 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-15 22:07:51,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:07:53,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:07:55,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:07:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:56,525 INFO L93 Difference]: Finished difference Result 356 states and 396 transitions. [2023-02-15 22:07:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:07:56,525 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-15 22:07:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:56,526 INFO L225 Difference]: With dead ends: 356 [2023-02-15 22:07:56,526 INFO L226 Difference]: Without dead ends: 356 [2023-02-15 22:07:56,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 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-15 22:07:56,527 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 166 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 28 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:56,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 998 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 796 Invalid, 4 Unknown, 0 Unchecked, 6.6s Time] [2023-02-15 22:07:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-02-15 22:07:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 335. [2023-02-15 22:07:56,530 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-15 22:07:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 379 transitions. [2023-02-15 22:07:56,530 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 379 transitions. Word has length 35 [2023-02-15 22:07:56,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:56,530 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 379 transitions. [2023-02-15 22:07:56,530 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-15 22:07:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 379 transitions. [2023-02-15 22:07:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:07:56,531 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:56,531 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-15 22:07:56,544 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-15 22:07:56,744 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-15 22:07:56,744 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-15 22:07:56,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:56,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1327181508, now seen corresponding path program 1 times [2023-02-15 22:07:56,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:56,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682557140] [2023-02-15 22:07:56,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:56,745 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-15 22:07:56,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:56,746 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-15 22:07:56,747 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-15 22:07:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:56,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:07:56,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:56,868 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-15 22:07:56,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:07:56,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:56,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682557140] [2023-02-15 22:07:56,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682557140] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:07:56,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:07:56,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:07:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931885811] [2023-02-15 22:07:56,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:56,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:07:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:56,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:07:56,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:07:56,870 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-15 22:07:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:57,357 INFO L93 Difference]: Finished difference Result 353 states and 399 transitions. [2023-02-15 22:07:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:07:57,358 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-15 22:07:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:57,359 INFO L225 Difference]: With dead ends: 353 [2023-02-15 22:07:57,359 INFO L226 Difference]: Without dead ends: 353 [2023-02-15 22:07:57,359 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-15 22:07:57,360 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-15 22:07:57,360 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-15 22:07:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-02-15 22:07:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 336. [2023-02-15 22:07:57,363 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-15 22:07:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 382 transitions. [2023-02-15 22:07:57,363 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 382 transitions. Word has length 37 [2023-02-15 22:07:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:57,363 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 382 transitions. [2023-02-15 22:07:57,364 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-15 22:07:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 382 transitions. [2023-02-15 22:07:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:07:57,364 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:57,364 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-15 22:07:57,371 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 (41)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:57,564 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-15 22:07:57,564 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-15 22:07:57,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1327181509, now seen corresponding path program 1 times [2023-02-15 22:07:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:57,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954934429] [2023-02-15 22:07:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:57,565 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-15 22:07:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:57,568 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-15 22:07:57,568 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-15 22:07:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:57,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:07:57,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:57,887 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:07:57,888 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-15 22:07:57,897 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-15 22:07:57,917 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:07:57,917 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-15 22:07:57,927 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-15 22:07:58,098 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-15 22:07:58,194 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-15 22:07:58,209 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:58,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:07:58,214 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-15 22:07:58,299 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-15 22:07:58,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:58,430 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-15 22:07:58,702 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-15 22:07:58,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:58,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954934429] [2023-02-15 22:07:58,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954934429] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:58,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:07:58,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2023-02-15 22:07:58,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966146067] [2023-02-15 22:07:58,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:58,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:07:58,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:58,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:07:58,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:07:58,703 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-15 22:07:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:59,564 INFO L93 Difference]: Finished difference Result 342 states and 387 transitions. [2023-02-15 22:07:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:07:59,565 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-15 22:07:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:59,566 INFO L225 Difference]: With dead ends: 342 [2023-02-15 22:07:59,566 INFO L226 Difference]: Without dead ends: 342 [2023-02-15 22:07:59,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:07:59,567 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 39 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:59,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1656 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 22:07:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-02-15 22:07:59,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2023-02-15 22:07:59,570 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-15 22:07:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 384 transitions. [2023-02-15 22:07:59,570 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 384 transitions. Word has length 37 [2023-02-15 22:07:59,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:59,570 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 384 transitions. [2023-02-15 22:07:59,570 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-15 22:07:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 384 transitions. [2023-02-15 22:07:59,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:07:59,571 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:59,571 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-15 22:07:59,590 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-15 22:07:59,778 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-15 22:07:59,778 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-15 22:07:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -445295076, now seen corresponding path program 1 times [2023-02-15 22:07:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:59,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418309414] [2023-02-15 22:07:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:59,778 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-15 22:07:59,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:59,780 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-15 22:07:59,782 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-15 22:07:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:59,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:07:59,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:59,880 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-15 22:07:59,958 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:07:59,958 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-15 22:08:00,038 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-15 22:08:00,044 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-15 22:08:00,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:00,367 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-15 22:08:00,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:00,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418309414] [2023-02-15 22:08:00,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418309414] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:00,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:00,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-02-15 22:08:00,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580808772] [2023-02-15 22:08:00,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:00,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 22:08:00,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:00,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 22:08:00,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:08:00,369 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-15 22:08:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:03,243 INFO L93 Difference]: Finished difference Result 387 states and 431 transitions. [2023-02-15 22:08:03,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:08:03,243 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-15 22:08:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:03,244 INFO L225 Difference]: With dead ends: 387 [2023-02-15 22:08:03,244 INFO L226 Difference]: Without dead ends: 387 [2023-02-15 22:08:03,245 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-15 22:08:03,245 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 447 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 67 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:03,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1549 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1524 Invalid, 2 Unknown, 0 Unchecked, 2.8s Time] [2023-02-15 22:08:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-02-15 22:08:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 341. [2023-02-15 22:08:03,249 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-15 22:08:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 387 transitions. [2023-02-15 22:08:03,250 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 387 transitions. Word has length 38 [2023-02-15 22:08:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:03,250 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 387 transitions. [2023-02-15 22:08:03,250 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-15 22:08:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 387 transitions. [2023-02-15 22:08:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:08:03,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:03,251 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-15 22:08:03,260 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-15 22:08:03,471 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-15 22:08:03,471 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-15 22:08:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:03,471 INFO L85 PathProgramCache]: Analyzing trace with hash -183877918, now seen corresponding path program 1 times [2023-02-15 22:08:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:03,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471862057] [2023-02-15 22:08:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:03,472 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-15 22:08:03,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:03,473 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-15 22:08:03,475 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-15 22:08:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:03,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 22:08:03,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:05,988 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~client~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_431 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~cfg~2#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|)) (= (_ bv0 1) (bvadd (select .cse0 |ULTIMATE.start_entry_point_~client~0#1.base|) (_ bv1 1))))))) (not (= (_ bv0 32) |ULTIMATE.start_entry_point_~client~0#1.base|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~client~0#1.base|)))) is different from true [2023-02-15 22:08:06,131 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-15 22:08:06,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:06,283 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-15 22:08:09,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:09,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471862057] [2023-02-15 22:08:09,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471862057] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:09,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [246777498] [2023-02-15 22:08:09,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:09,545 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:09,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:08:09,547 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-15 22:08:09,564 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-15 22:08:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:09,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 22:08:09,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:12,459 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-15 22:08:12,606 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-15 22:08:12,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:14,857 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-15 22:08:19,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [246777498] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:19,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:19,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2023-02-15 22:08:19,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137062941] [2023-02-15 22:08:19,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:19,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 22:08:19,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:19,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 22:08:19,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=8, NotChecked=110, Total=930 [2023-02-15 22:08:19,347 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-15 22:08:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:25,652 INFO L93 Difference]: Finished difference Result 356 states and 401 transitions. [2023-02-15 22:08:25,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 22:08:25,653 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-15 22:08:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:25,654 INFO L225 Difference]: With dead ends: 356 [2023-02-15 22:08:25,654 INFO L226 Difference]: Without dead ends: 339 [2023-02-15 22:08:25,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=189, Invalid=1143, Unknown=8, NotChecked=142, Total=1482 [2023-02-15 22:08:25,655 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 393 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 59 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 3408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 688 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:25,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 2597 Invalid, 3408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2648 Invalid, 13 Unknown, 688 Unchecked, 5.8s Time] [2023-02-15 22:08:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-02-15 22:08:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2023-02-15 22:08:25,664 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-15 22:08:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 384 transitions. [2023-02-15 22:08:25,665 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 384 transitions. Word has length 39 [2023-02-15 22:08:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:25,665 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 384 transitions. [2023-02-15 22:08:25,665 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-15 22:08:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 384 transitions. [2023-02-15 22:08:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:08:25,665 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:25,665 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-15 22:08:25,674 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-15 22:08:25,873 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-15 22:08:26,068 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-15 22:08:26,068 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-15 22:08:26,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:26,069 INFO L85 PathProgramCache]: Analyzing trace with hash 224946307, now seen corresponding path program 1 times [2023-02-15 22:08:26,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:26,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209670841] [2023-02-15 22:08:26,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:26,069 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-15 22:08:26,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:26,070 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-15 22:08:26,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2023-02-15 22:08:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:26,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:08:26,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:26,186 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-15 22:08:26,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:26,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:26,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209670841] [2023-02-15 22:08:26,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209670841] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:26,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:26,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:08:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547858683] [2023-02-15 22:08:26,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:26,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:08:26,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:26,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:08:26,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:08:26,188 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-15 22:08:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:26,230 INFO L93 Difference]: Finished difference Result 327 states and 371 transitions. [2023-02-15 22:08:26,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:08:26,231 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-15 22:08:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:26,232 INFO L225 Difference]: With dead ends: 327 [2023-02-15 22:08:26,232 INFO L226 Difference]: Without dead ends: 327 [2023-02-15 22:08:26,232 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-15 22:08:26,233 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-15 22:08:26,233 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-15 22:08:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-15 22:08:26,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2023-02-15 22:08:26,236 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-15 22:08:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 371 transitions. [2023-02-15 22:08:26,237 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 371 transitions. Word has length 39 [2023-02-15 22:08:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:26,237 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 371 transitions. [2023-02-15 22:08:26,237 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-15 22:08:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 371 transitions. [2023-02-15 22:08:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:08:26,237 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:26,238 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-15 22:08:26,248 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-15 22:08:26,445 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-15 22:08:26,445 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-15 22:08:26,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1294605214, now seen corresponding path program 1 times [2023-02-15 22:08:26,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:26,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690312774] [2023-02-15 22:08:26,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:26,446 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-15 22:08:26,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:26,447 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-15 22:08:26,450 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-15 22:08:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:26,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:08:26,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:26,608 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-15 22:08:26,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:26,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:26,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690312774] [2023-02-15 22:08:26,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690312774] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:26,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:26,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:08:26,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541362557] [2023-02-15 22:08:26,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:26,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:08:26,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:26,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:08:26,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:08:26,609 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-15 22:08:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:26,646 INFO L93 Difference]: Finished difference Result 368 states and 416 transitions. [2023-02-15 22:08:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:08:26,647 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-15 22:08:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:26,648 INFO L225 Difference]: With dead ends: 368 [2023-02-15 22:08:26,648 INFO L226 Difference]: Without dead ends: 368 [2023-02-15 22:08:26,648 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-15 22:08:26,648 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-15 22:08:26,649 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-15 22:08:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-02-15 22:08:26,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 329. [2023-02-15 22:08:26,651 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-15 22:08:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 373 transitions. [2023-02-15 22:08:26,652 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 373 transitions. Word has length 41 [2023-02-15 22:08:26,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:26,652 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 373 transitions. [2023-02-15 22:08:26,652 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-15 22:08:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 373 transitions. [2023-02-15 22:08:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:08:26,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:26,654 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-15 22:08:26,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 (47)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:26,860 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-15 22:08:26,861 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-15 22:08:26,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:26,861 INFO L85 PathProgramCache]: Analyzing trace with hash -789046589, now seen corresponding path program 2 times [2023-02-15 22:08:26,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:26,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827411800] [2023-02-15 22:08:26,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:08:26,861 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-15 22:08:26,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:26,864 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-15 22:08:26,866 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-15 22:08:26,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:08:26,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:08:26,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:08:26,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:27,002 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-15 22:08:27,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:27,031 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-15 22:08:27,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:27,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827411800] [2023-02-15 22:08:27,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827411800] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:27,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:27,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-15 22:08:27,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300963002] [2023-02-15 22:08:27,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:27,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:08:27,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:27,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:08:27,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:08:27,033 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-15 22:08:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:27,074 INFO L93 Difference]: Finished difference Result 328 states and 372 transitions. [2023-02-15 22:08:27,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:08:27,074 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-15 22:08:27,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:27,075 INFO L225 Difference]: With dead ends: 328 [2023-02-15 22:08:27,075 INFO L226 Difference]: Without dead ends: 328 [2023-02-15 22:08:27,075 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-15 22:08:27,075 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:27,076 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.0s Time] [2023-02-15 22:08:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-02-15 22:08:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2023-02-15 22:08:27,078 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-15 22:08:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 372 transitions. [2023-02-15 22:08:27,079 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 372 transitions. Word has length 41 [2023-02-15 22:08:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:27,079 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 372 transitions. [2023-02-15 22:08:27,079 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-15 22:08:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 372 transitions. [2023-02-15 22:08:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:08:27,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:27,079 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-15 22:08:27,087 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-15 22:08:27,287 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-15 22:08:27,287 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-15 22:08:27,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1368793298, now seen corresponding path program 1 times [2023-02-15 22:08:27,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:27,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027017048] [2023-02-15 22:08:27,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:27,288 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-15 22:08:27,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:27,289 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-15 22:08:27,290 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-15 22:08:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:27,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 22:08:27,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:27,396 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-15 22:08:27,480 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:27,480 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-15 22:08:27,568 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:27,569 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-15 22:08:27,661 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-15 22:08:27,674 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-15 22:08:27,679 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-15 22:08:27,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:27,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:27,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027017048] [2023-02-15 22:08:27,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027017048] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:27,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [586499226] [2023-02-15 22:08:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:27,985 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:27,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:08:27,986 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-15 22:08:27,986 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-15 22:08:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:28,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 22:08:28,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:28,157 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-15 22:08:28,194 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:08:28,194 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-15 22:08:28,277 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:28,278 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-15 22:08:28,335 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-15 22:08:28,355 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-15 22:08:28,360 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-15 22:08:28,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:28,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [586499226] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:28,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:28,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2023-02-15 22:08:28,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835716488] [2023-02-15 22:08:28,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:28,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:08:28,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:28,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:08:28,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:08:28,591 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-15 22:08:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:30,284 INFO L93 Difference]: Finished difference Result 348 states and 388 transitions. [2023-02-15 22:08:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:08:30,285 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-15 22:08:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:30,286 INFO L225 Difference]: With dead ends: 348 [2023-02-15 22:08:30,286 INFO L226 Difference]: Without dead ends: 348 [2023-02-15 22:08:30,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:08:30,289 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 668 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:30,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1294 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-15 22:08:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-02-15 22:08:30,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 331. [2023-02-15 22:08:30,307 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-15 22:08:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 375 transitions. [2023-02-15 22:08:30,312 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 375 transitions. Word has length 41 [2023-02-15 22:08:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:30,313 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 375 transitions. [2023-02-15 22:08:30,313 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-15 22:08:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 375 transitions. [2023-02-15 22:08:30,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 22:08:30,313 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:30,313 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-15 22:08:30,321 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 (49)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:30,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (50)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:30,723 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-15 22:08:30,723 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-15 22:08:30,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:30,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1309353403, now seen corresponding path program 1 times [2023-02-15 22:08:30,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:30,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502349170] [2023-02-15 22:08:30,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:30,724 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-15 22:08:30,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:30,725 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-15 22:08:30,726 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-15 22:08:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:30,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:08:30,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:30,869 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-15 22:08:30,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:30,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:30,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502349170] [2023-02-15 22:08:30,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502349170] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:30,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:30,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:08:30,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186491639] [2023-02-15 22:08:30,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:30,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:08:30,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:30,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:08:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:08:30,870 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-15 22:08:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:30,914 INFO L93 Difference]: Finished difference Result 385 states and 433 transitions. [2023-02-15 22:08:30,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:08:30,914 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-15 22:08:30,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:30,915 INFO L225 Difference]: With dead ends: 385 [2023-02-15 22:08:30,915 INFO L226 Difference]: Without dead ends: 385 [2023-02-15 22:08:30,915 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-15 22:08:30,916 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-15 22:08:30,916 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-15 22:08:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-02-15 22:08:30,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 333. [2023-02-15 22:08:30,919 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-15 22:08:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 377 transitions. [2023-02-15 22:08:30,919 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 377 transitions. Word has length 42 [2023-02-15 22:08:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:30,920 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 377 transitions. [2023-02-15 22:08:30,920 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-15 22:08:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 377 transitions. [2023-02-15 22:08:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 22:08:30,920 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:30,920 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-15 22:08:30,936 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-15 22:08:31,120 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-15 22:08:31,120 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-15 22:08:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:31,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1309359926, now seen corresponding path program 1 times [2023-02-15 22:08:31,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:31,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944048836] [2023-02-15 22:08:31,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:31,121 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-15 22:08:31,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:31,122 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-15 22:08:31,124 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-15 22:08:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:31,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:08:31,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:31,606 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-15 22:08:31,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:31,703 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-15 22:08:31,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:31,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944048836] [2023-02-15 22:08:31,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944048836] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:31,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:31,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-15 22:08:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269061371] [2023-02-15 22:08:31,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:31,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:08:31,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:31,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:08:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:08:31,704 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-15 22:08:32,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:32,201 INFO L93 Difference]: Finished difference Result 334 states and 378 transitions. [2023-02-15 22:08:32,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:08:32,202 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-15 22:08:32,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:32,203 INFO L225 Difference]: With dead ends: 334 [2023-02-15 22:08:32,203 INFO L226 Difference]: Without dead ends: 334 [2023-02-15 22:08:32,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 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-15 22:08:32,203 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-15 22:08:32,203 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-15 22:08:32,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-02-15 22:08:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2023-02-15 22:08:32,206 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-15 22:08:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 376 transitions. [2023-02-15 22:08:32,207 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 376 transitions. Word has length 42 [2023-02-15 22:08:32,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:32,207 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 376 transitions. [2023-02-15 22:08:32,207 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-15 22:08:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 376 transitions. [2023-02-15 22:08:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 22:08:32,207 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:32,207 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-15 22:08:32,223 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 (52)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:32,422 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-15 22:08:32,423 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-15 22:08:32,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash 421849722, now seen corresponding path program 1 times [2023-02-15 22:08:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:32,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70900442] [2023-02-15 22:08:32,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:32,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:08:32,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:32,424 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-15 22:08:32,466 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-15 22:08:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:32,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:08:32,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:32,545 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-15 22:08:32,580 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-15 22:08:32,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:32,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:32,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70900442] [2023-02-15 22:08:32,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70900442] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:32,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:32,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:08:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726703911] [2023-02-15 22:08:32,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:32,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:08:32,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:08:32,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:08:32,581 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-15 22:08:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:33,164 INFO L93 Difference]: Finished difference Result 335 states and 379 transitions. [2023-02-15 22:08:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:08:33,165 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-15 22:08:33,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:33,166 INFO L225 Difference]: With dead ends: 335 [2023-02-15 22:08:33,166 INFO L226 Difference]: Without dead ends: 335 [2023-02-15 22:08:33,166 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-15 22:08:33,167 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 14 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-15 22:08:33,167 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-15 22:08:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-02-15 22:08:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2023-02-15 22:08:33,170 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-15 22:08:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 375 transitions. [2023-02-15 22:08:33,170 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 375 transitions. Word has length 42 [2023-02-15 22:08:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:33,170 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 375 transitions. [2023-02-15 22:08:33,171 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-15 22:08:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 375 transitions. [2023-02-15 22:08:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 22:08:33,171 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:33,171 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-15 22:08:33,179 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 (53)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:33,372 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-15 22:08:33,372 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-15 22:08:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:33,372 INFO L85 PathProgramCache]: Analyzing trace with hash 421849723, now seen corresponding path program 1 times [2023-02-15 22:08:33,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:33,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644721687] [2023-02-15 22:08:33,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:33,373 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-15 22:08:33,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:33,374 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-15 22:08:33,376 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-15 22:08:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:33,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:08:33,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:33,499 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-15 22:08:33,560 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-15 22:08:33,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:33,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:33,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644721687] [2023-02-15 22:08:33,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644721687] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:33,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:33,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:08:33,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221789040] [2023-02-15 22:08:33,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:33,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:08:33,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:33,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:08:33,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:08:33,561 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-15 22:08:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:34,276 INFO L93 Difference]: Finished difference Result 381 states and 429 transitions. [2023-02-15 22:08:34,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:08:34,277 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-15 22:08:34,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:34,278 INFO L225 Difference]: With dead ends: 381 [2023-02-15 22:08:34,278 INFO L226 Difference]: Without dead ends: 381 [2023-02-15 22:08:34,278 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-15 22:08:34,292 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 54 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:34,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1399 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:08:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-02-15 22:08:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 330. [2023-02-15 22:08:34,301 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-15 22:08:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 374 transitions. [2023-02-15 22:08:34,301 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 374 transitions. Word has length 42 [2023-02-15 22:08:34,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:34,301 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 374 transitions. [2023-02-15 22:08:34,302 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-15 22:08:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 374 transitions. [2023-02-15 22:08:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:08:34,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:34,303 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-15 22:08:34,324 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 (54)] Ended with exit code 0 [2023-02-15 22:08:34,523 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-15 22:08:34,524 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-15 22:08:34,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1935452453, now seen corresponding path program 1 times [2023-02-15 22:08:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:34,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261500077] [2023-02-15 22:08:34,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:34,524 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-15 22:08:34,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:34,525 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-15 22:08:34,527 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-15 22:08:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:34,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:08:34,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:34,641 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-15 22:08:34,678 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-15 22:08:34,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:34,742 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-15 22:08:34,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:34,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261500077] [2023-02-15 22:08:34,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261500077] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:34,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:34,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-02-15 22:08:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028293972] [2023-02-15 22:08:34,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:34,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:08:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:34,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:08:34,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:08:34,744 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-15 22:08:36,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:08:37,880 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-15 22:08:39,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:08:40,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:08:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:40,414 INFO L93 Difference]: Finished difference Result 348 states and 388 transitions. [2023-02-15 22:08:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:08:40,415 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-15 22:08:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:40,416 INFO L225 Difference]: With dead ends: 348 [2023-02-15 22:08:40,416 INFO L226 Difference]: Without dead ends: 348 [2023-02-15 22:08:40,416 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-15 22:08:40,417 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 155 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 26 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s 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, 5.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:40,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 984 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 773 Invalid, 4 Unknown, 0 Unchecked, 5.6s Time] [2023-02-15 22:08:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-02-15 22:08:40,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 333. [2023-02-15 22:08:40,435 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-15 22:08:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 377 transitions. [2023-02-15 22:08:40,436 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 377 transitions. Word has length 43 [2023-02-15 22:08:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:40,436 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 377 transitions. [2023-02-15 22:08:40,436 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-15 22:08:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 377 transitions. [2023-02-15 22:08:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:08:40,444 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:40,444 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-15 22:08:40,453 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-15 22:08:40,651 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-15 22:08:40,651 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-15 22:08:40,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:40,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1150380693, now seen corresponding path program 1 times [2023-02-15 22:08:40,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:40,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080890722] [2023-02-15 22:08:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:40,652 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-15 22:08:40,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:40,653 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-15 22:08:40,654 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-15 22:08:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:40,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:08:40,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:40,837 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:40,838 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-15 22:08:40,946 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:40,946 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-15 22:08:41,057 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:41,057 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-15 22:08:41,234 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-15 22:08:41,261 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-15 22:08:41,283 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-15 22:08:41,289 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-15 22:08:41,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:41,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:41,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080890722] [2023-02-15 22:08:41,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080890722] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:41,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [31503817] [2023-02-15 22:08:41,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:41,404 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:41,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:08:41,405 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-15 22:08:41,406 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-15 22:08:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:41,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 22:08:41,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:41,613 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-15 22:08:41,663 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:41,663 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-15 22:08:41,799 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:41,799 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-15 22:08:42,100 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-15 22:08:42,100 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-15 22:08:42,607 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-15 22:08:42,830 INFO L321 Elim1Store]: treesize reduction 60, result has 27.7 percent of original size [2023-02-15 22:08:42,830 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 33 treesize of output 53 [2023-02-15 22:08:43,737 INFO L321 Elim1Store]: treesize reduction 64, result has 26.4 percent of original size [2023-02-15 22:08:43,738 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 31 treesize of output 53 [2023-02-15 22:08:43,837 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-15 22:08:43,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:44,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [31503817] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:44,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:44,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17] total 21 [2023-02-15 22:08:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885241758] [2023-02-15 22:08:44,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:44,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 22:08:44,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:44,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 22:08:44,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2023-02-15 22:08:44,317 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-15 22:08:46,365 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-15 22:08:50,400 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-15 22:08:52,409 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-15 22:08:54,534 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-15 22:08:57,153 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-15 22:08:59,155 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-15 22:09:01,159 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-15 22:09:03,183 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-15 22:09:05,185 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-15 22:09:07,191 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-15 22:09:09,231 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-15 22:09:11,233 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-15 22:09:13,237 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-15 22:09:15,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:09:17,340 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-15 22:09:19,347 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-15 22:09:22,012 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-15 22:09:24,015 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-15 22:09:26,019 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-15 22:09:28,034 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-15 22:09:30,036 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-15 22:09:32,039 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-15 22:09:34,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]