./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:28:51,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:28:51,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:28:51,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:28:51,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:28:51,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:28:51,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:28:51,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:28:51,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:28:51,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:28:51,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:28:51,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:28:51,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:28:51,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:28:51,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:28:51,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:28:51,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:28:51,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:28:51,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:28:51,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:28:51,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:28:51,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:28:51,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:28:51,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:28:51,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:28:51,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:28:51,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:28:51,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:28:51,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:28:51,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:28:51,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:28:51,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:28:51,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:28:51,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:28:51,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:28:51,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:28:51,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:28:51,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:28:51,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:28:51,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:28:51,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:28:51,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:28:51,386 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:28:51,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:28:51,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:28:51,387 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:28:51,387 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:28:51,388 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:28:51,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:28:51,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:28:51,388 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:28:51,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:28:51,389 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:28:51,389 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:28:51,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:28:51,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:28:51,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:28:51,390 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:28:51,390 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:28:51,390 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:28:51,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:28:51,391 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:28:51,391 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:28:51,391 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:28:51,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:28:51,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:28:51,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:28:51,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:28:51,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:28:51,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:28:51,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:28:51,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:28:51,392 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:28:51,393 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:28:51,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:28:51,393 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:28:51,393 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 -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2023-02-16 03:28:51,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:28:51,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:28:51,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:28:51,648 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:28:51,648 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:28:51,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2023-02-16 03:28:52,895 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:28:53,153 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:28:53,153 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2023-02-16 03:28:53,171 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/248df9fe9/342c7b3e89e6414da3f7574a12b95a46/FLAG78ecc3ce1 [2023-02-16 03:28:53,188 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/248df9fe9/342c7b3e89e6414da3f7574a12b95a46 [2023-02-16 03:28:53,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:28:53,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:28:53,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:28:53,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:28:53,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:28:53,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:28:53" (1/1) ... [2023-02-16 03:28:53,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f181d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:53, skipping insertion in model container [2023-02-16 03:28:53,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:28:53" (1/1) ... [2023-02-16 03:28:53,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:28:53,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:28:53,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:28:53,663 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-16 03:28:53,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@c0f97e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:53, skipping insertion in model container [2023-02-16 03:28:53,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:28:53,665 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-16 03:28:53,666 INFO L158 Benchmark]: Toolchain (without parser) took 474.32ms. Allocated memory is still 138.4MB. Free memory was 105.1MB in the beginning and 90.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 03:28:53,667 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:28:53,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.32ms. Allocated memory is still 138.4MB. Free memory was 105.1MB in the beginning and 90.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 03:28:53,669 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.18ms. Allocated memory is still 113.2MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.32ms. Allocated memory is still 138.4MB. Free memory was 105.1MB in the beginning and 90.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:28:55,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:28:55,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:28:55,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:28:55,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:28:55,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:28:55,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:28:55,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:28:55,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:28:55,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:28:55,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:28:55,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:28:55,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:28:55,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:28:55,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:28:55,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:28:55,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:28:55,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:28:55,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:28:55,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:28:55,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:28:55,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:28:55,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:28:55,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:28:55,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:28:55,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:28:55,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:28:55,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:28:55,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:28:55,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:28:55,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:28:55,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:28:55,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:28:55,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:28:55,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:28:55,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:28:55,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:28:55,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:28:55,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:28:55,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:28:55,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:28:55,560 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-16 03:28:55,586 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:28:55,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:28:55,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:28:55,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:28:55,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:28:55,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:28:55,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:28:55,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:28:55,589 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:28:55,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:28:55,589 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:28:55,590 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:28:55,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:28:55,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:28:55,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:28:55,590 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:28:55,590 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:28:55,591 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:28:55,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:28:55,591 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:28:55,591 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:28:55,591 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:28:55,591 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:28:55,591 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:28:55,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:28:55,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:28:55,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:28:55,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:28:55,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:28:55,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:28:55,593 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:28:55,593 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:28:55,593 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:28:55,593 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:28:55,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:28:55,594 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:28:55,594 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:28:55,594 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 -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2023-02-16 03:28:55,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:28:55,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:28:55,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:28:55,893 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:28:55,893 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:28:55,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2023-02-16 03:28:56,933 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:28:57,206 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:28:57,207 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2023-02-16 03:28:57,229 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f63c9cf/e086833e562e4e9d94422535d8573d6f/FLAG92bf71915 [2023-02-16 03:28:57,244 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f63c9cf/e086833e562e4e9d94422535d8573d6f [2023-02-16 03:28:57,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:28:57,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:28:57,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:28:57,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:28:57,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:28:57,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f7b42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57, skipping insertion in model container [2023-02-16 03:28:57,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:28:57,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:28:57,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:28:57,687 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-16 03:28:57,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:28:57,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:28:57,765 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:28:57,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:28:57,844 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:28:57,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57 WrapperNode [2023-02-16 03:28:57,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:28:57,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:28:57,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:28:57,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:28:57,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,890 INFO L138 Inliner]: procedures = 175, calls = 119, calls flagged for inlining = 30, calls inlined = 15, statements flattened = 195 [2023-02-16 03:28:57,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:28:57,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:28:57,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:28:57,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:28:57,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,960 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:28:57,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:28:57,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:28:57,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:28:57,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57" (1/1) ... [2023-02-16 03:28:57,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:28:57,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:28:58,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 03:28:58,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 03:28:58,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-16 03:28:58,065 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2023-02-16 03:28:58,065 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2023-02-16 03:28:58,066 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-16 03:28:58,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-16 03:28:58,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-16 03:28:58,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-16 03:28:58,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:28:58,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:28:58,067 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2023-02-16 03:28:58,067 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2023-02-16 03:28:58,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 03:28:58,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:28:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:28:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-16 03:28:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:28:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 03:28:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2023-02-16 03:28:58,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2023-02-16 03:28:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-02-16 03:28:58,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-02-16 03:28:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:28:58,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:28:58,252 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:28:58,253 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:28:58,979 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:28:58,984 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:28:58,987 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 03:28:58,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:28:58 BoogieIcfgContainer [2023-02-16 03:28:58,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:28:58,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:28:58,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:28:58,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:28:58,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:28:57" (1/3) ... [2023-02-16 03:28:58,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d958f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:28:58, skipping insertion in model container [2023-02-16 03:28:58,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:28:57" (2/3) ... [2023-02-16 03:28:59,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d958f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:28:59, skipping insertion in model container [2023-02-16 03:28:59,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:28:58" (3/3) ... [2023-02-16 03:28:59,003 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test23_2.i [2023-02-16 03:28:59,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:28:59,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2023-02-16 03:28:59,071 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:28:59,077 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;@6cb41de4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:28:59,077 INFO L358 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2023-02-16 03:28:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 110 states have (on average 1.8454545454545455) internal successors, (203), 189 states have internal predecessors, (203), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-16 03:28:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:28:59,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:28:59,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:28:59,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:28:59,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:28:59,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1281397623, now seen corresponding path program 1 times [2023-02-16 03:28:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:28:59,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160350792] [2023-02-16 03:28:59,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:28:59,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-16 03:28:59,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:28:59,133 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:28:59,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-16 03:28:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:28:59,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:28:59,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:28:59,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:28:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:28:59,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:28:59,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:28:59,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160350792] [2023-02-16 03:28:59,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160350792] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:28:59,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:28:59,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:28:59,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219008613] [2023-02-16 03:28:59,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:28:59,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:28:59,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:28:59,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:28:59,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:28:59,388 INFO L87 Difference]: Start difference. First operand has 204 states, 110 states have (on average 1.8454545454545455) internal successors, (203), 189 states have internal predecessors, (203), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:28:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:28:59,981 INFO L93 Difference]: Finished difference Result 231 states and 247 transitions. [2023-02-16 03:28:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:28:59,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-16 03:28:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:28:59,990 INFO L225 Difference]: With dead ends: 231 [2023-02-16 03:28:59,990 INFO L226 Difference]: Without dead ends: 227 [2023-02-16 03:28:59,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:28:59,993 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 28 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:28:59,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 839 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:29:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-16 03:29:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 211. [2023-02-16 03:29:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 116 states have (on average 1.793103448275862) internal successors, (208), 194 states have internal predecessors, (208), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-16 03:29:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 227 transitions. [2023-02-16 03:29:00,029 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 227 transitions. Word has length 12 [2023-02-16 03:29:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:00,029 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 227 transitions. [2023-02-16 03:29:00,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:29:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 227 transitions. [2023-02-16 03:29:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:29:00,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:00,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:00,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:00,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:00,238 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:00,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:00,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1281397624, now seen corresponding path program 1 times [2023-02-16 03:29:00,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:00,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842510035] [2023-02-16 03:29:00,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:00,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:00,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:00,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:00,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-16 03:29:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:00,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 03:29:00,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:00,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:29:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:00,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:00,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:00,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842510035] [2023-02-16 03:29:00,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842510035] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:00,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:00,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:29:00,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592982756] [2023-02-16 03:29:00,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:00,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:29:00,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:00,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:29:00,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:29:00,437 INFO L87 Difference]: Start difference. First operand 211 states and 227 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:29:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:01,091 INFO L93 Difference]: Finished difference Result 236 states and 251 transitions. [2023-02-16 03:29:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:29:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-16 03:29:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:01,094 INFO L225 Difference]: With dead ends: 236 [2023-02-16 03:29:01,094 INFO L226 Difference]: Without dead ends: 236 [2023-02-16 03:29:01,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:29:01,095 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 35 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:01,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1152 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 03:29:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-16 03:29:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 211. [2023-02-16 03:29:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 116 states have (on average 1.7758620689655173) internal successors, (206), 194 states have internal predecessors, (206), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-16 03:29:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 225 transitions. [2023-02-16 03:29:01,104 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 225 transitions. Word has length 12 [2023-02-16 03:29:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:01,104 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 225 transitions. [2023-02-16 03:29:01,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:29:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 225 transitions. [2023-02-16 03:29:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:29:01,105 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:01,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:01,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:01,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:01,313 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1270759338, now seen corresponding path program 1 times [2023-02-16 03:29:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:01,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881027380] [2023-02-16 03:29:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:01,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:01,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:01,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:01,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-16 03:29:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:01,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:29:01,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:01,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:01,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:01,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881027380] [2023-02-16 03:29:01,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881027380] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:01,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:01,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:29:01,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844400743] [2023-02-16 03:29:01,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:01,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:29:01,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:01,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:29:01,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:29:01,422 INFO L87 Difference]: Start difference. First operand 211 states and 225 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:29:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:01,454 INFO L93 Difference]: Finished difference Result 223 states and 237 transitions. [2023-02-16 03:29:01,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:29:01,455 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-16 03:29:01,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:01,456 INFO L225 Difference]: With dead ends: 223 [2023-02-16 03:29:01,456 INFO L226 Difference]: Without dead ends: 223 [2023-02-16 03:29:01,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:29:01,458 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 20 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:01,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 836 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:29:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-02-16 03:29:01,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 202. [2023-02-16 03:29:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 112 states have (on average 1.7678571428571428) internal successors, (198), 186 states have internal predecessors, (198), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-16 03:29:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 215 transitions. [2023-02-16 03:29:01,465 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 215 transitions. Word has length 12 [2023-02-16 03:29:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:01,465 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 215 transitions. [2023-02-16 03:29:01,466 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:29:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 215 transitions. [2023-02-16 03:29:01,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:29:01,466 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:01,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:01,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:01,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:01,674 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:01,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1281312215, now seen corresponding path program 1 times [2023-02-16 03:29:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:01,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641932014] [2023-02-16 03:29:01,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:01,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:01,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:01,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:01,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-16 03:29:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:01,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:29:01,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:01,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:01,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:01,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641932014] [2023-02-16 03:29:01,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641932014] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:01,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:01,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:29:01,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555704133] [2023-02-16 03:29:01,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:01,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:29:01,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:01,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:29:01,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:29:01,760 INFO L87 Difference]: Start difference. First operand 202 states and 215 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:29:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:01,785 INFO L93 Difference]: Finished difference Result 223 states and 236 transitions. [2023-02-16 03:29:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:29:01,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2023-02-16 03:29:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:01,787 INFO L225 Difference]: With dead ends: 223 [2023-02-16 03:29:01,787 INFO L226 Difference]: Without dead ends: 223 [2023-02-16 03:29:01,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:29:01,788 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 127 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:01,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 768 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:29:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-02-16 03:29:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 202. [2023-02-16 03:29:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 186 states have internal predecessors, (197), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-16 03:29:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 214 transitions. [2023-02-16 03:29:01,800 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 214 transitions. Word has length 12 [2023-02-16 03:29:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:01,800 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 214 transitions. [2023-02-16 03:29:01,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:29:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 214 transitions. [2023-02-16 03:29:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:29:01,801 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:01,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:01,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:02,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:02,008 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:02,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:02,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1270844746, now seen corresponding path program 1 times [2023-02-16 03:29:02,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:02,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758012373] [2023-02-16 03:29:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:02,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:02,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:02,011 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:02,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-16 03:29:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:02,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:29:02,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:02,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:02,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:02,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758012373] [2023-02-16 03:29:02,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758012373] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:02,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:02,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:29:02,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578087301] [2023-02-16 03:29:02,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:02,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:29:02,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:02,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:29:02,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:29:02,077 INFO L87 Difference]: Start difference. First operand 202 states and 214 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:29:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:02,105 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2023-02-16 03:29:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:29:02,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-16 03:29:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:02,106 INFO L225 Difference]: With dead ends: 207 [2023-02-16 03:29:02,107 INFO L226 Difference]: Without dead ends: 207 [2023-02-16 03:29:02,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:29:02,108 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 110 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:02,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 720 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:29:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-16 03:29:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2023-02-16 03:29:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 188 states have internal predecessors, (199), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-16 03:29:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2023-02-16 03:29:02,113 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 12 [2023-02-16 03:29:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:02,113 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2023-02-16 03:29:02,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:29:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2023-02-16 03:29:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:29:02,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:02,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:02,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-16 03:29:02,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:02,322 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:02,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash -741461350, now seen corresponding path program 1 times [2023-02-16 03:29:02,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:02,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631553349] [2023-02-16 03:29:02,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:02,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:02,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:02,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:02,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-16 03:29:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:02,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:29:02,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:02,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:02,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:02,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631553349] [2023-02-16 03:29:02,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631553349] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:02,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:02,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:29:02,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754574796] [2023-02-16 03:29:02,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:02,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:29:02,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:02,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:29:02,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:29:02,413 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:29:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:02,747 INFO L93 Difference]: Finished difference Result 216 states and 230 transitions. [2023-02-16 03:29:02,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:29:02,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-16 03:29:02,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:02,748 INFO L225 Difference]: With dead ends: 216 [2023-02-16 03:29:02,749 INFO L226 Difference]: Without dead ends: 208 [2023-02-16 03:29:02,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:29:02,749 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 51 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:02,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 380 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:29:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-16 03:29:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 198. [2023-02-16 03:29:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 109 states have (on average 1.7706422018348624) internal successors, (193), 183 states have internal predecessors, (193), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-16 03:29:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 209 transitions. [2023-02-16 03:29:02,753 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 209 transitions. Word has length 13 [2023-02-16 03:29:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:02,753 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 209 transitions. [2023-02-16 03:29:02,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:29:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 209 transitions. [2023-02-16 03:29:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:29:02,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:02,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:02,760 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 (7)] Ended with exit code 0 [2023-02-16 03:29:02,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:02,954 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:02,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:02,955 INFO L85 PathProgramCache]: Analyzing trace with hash 980413121, now seen corresponding path program 1 times [2023-02-16 03:29:02,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:02,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737933198] [2023-02-16 03:29:02,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:02,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:02,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:02,956 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:02,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-16 03:29:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:03,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:29:03,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:03,092 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_23 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))))) is different from true [2023-02-16 03:29:03,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:29:03,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-16 03:29:03,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:03,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:03,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:03,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737933198] [2023-02-16 03:29:03,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737933198] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:03,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:03,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:29:03,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988809406] [2023-02-16 03:29:03,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:03,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:29:03,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:03,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:29:03,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2023-02-16 03:29:03,152 INFO L87 Difference]: Start difference. First operand 198 states and 209 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:29:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:03,803 INFO L93 Difference]: Finished difference Result 249 states and 263 transitions. [2023-02-16 03:29:03,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:29:03,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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 16 [2023-02-16 03:29:03,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:03,805 INFO L225 Difference]: With dead ends: 249 [2023-02-16 03:29:03,805 INFO L226 Difference]: Without dead ends: 249 [2023-02-16 03:29:03,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2023-02-16 03:29:03,805 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 424 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:03,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 211 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 533 Invalid, 0 Unknown, 261 Unchecked, 0.6s Time] [2023-02-16 03:29:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-02-16 03:29:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 207. [2023-02-16 03:29:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 191 states have internal predecessors, (206), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-16 03:29:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2023-02-16 03:29:03,810 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 16 [2023-02-16 03:29:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:03,811 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2023-02-16 03:29:03,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:29:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2023-02-16 03:29:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:29:03,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:03,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:03,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:04,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:04,019 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:04,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:04,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1929045948, now seen corresponding path program 1 times [2023-02-16 03:29:04,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:04,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228039060] [2023-02-16 03:29:04,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:04,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:04,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:04,021 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:04,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-16 03:29:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:04,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:29:04,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:04,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:29:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:04,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:04,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:04,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228039060] [2023-02-16 03:29:04,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228039060] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:04,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:04,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:29:04,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506175172] [2023-02-16 03:29:04,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:04,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:29:04,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:04,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:29:04,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:29:04,171 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:04,575 INFO L93 Difference]: Finished difference Result 262 states and 286 transitions. [2023-02-16 03:29:04,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:29:04,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-02-16 03:29:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:04,577 INFO L225 Difference]: With dead ends: 262 [2023-02-16 03:29:04,577 INFO L226 Difference]: Without dead ends: 262 [2023-02-16 03:29:04,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:29:04,577 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 69 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:04,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 643 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:29:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-02-16 03:29:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 234. [2023-02-16 03:29:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 147 states have (on average 1.7687074829931972) internal successors, (260), 218 states have internal predecessors, (260), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-16 03:29:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 278 transitions. [2023-02-16 03:29:04,582 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 278 transitions. Word has length 25 [2023-02-16 03:29:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:04,582 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 278 transitions. [2023-02-16 03:29:04,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 278 transitions. [2023-02-16 03:29:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:29:04,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:04,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:04,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:04,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:04,791 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:04,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:04,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1929045947, now seen corresponding path program 1 times [2023-02-16 03:29:04,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:04,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178404847] [2023-02-16 03:29:04,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:04,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:04,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:04,793 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:04,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-16 03:29:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:04,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:29:04,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:04,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:29:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:04,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:04,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:04,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178404847] [2023-02-16 03:29:04,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178404847] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:04,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:04,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:29:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329372181] [2023-02-16 03:29:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:04,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:29:04,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:04,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:29:04,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:29:04,927 INFO L87 Difference]: Start difference. First operand 234 states and 278 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:05,438 INFO L93 Difference]: Finished difference Result 294 states and 321 transitions. [2023-02-16 03:29:05,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:29:05,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-02-16 03:29:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:05,440 INFO L225 Difference]: With dead ends: 294 [2023-02-16 03:29:05,440 INFO L226 Difference]: Without dead ends: 294 [2023-02-16 03:29:05,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:29:05,441 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 103 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:05,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 641 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:29:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-02-16 03:29:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 236. [2023-02-16 03:29:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 150 states have (on average 1.7466666666666666) internal successors, (262), 219 states have internal predecessors, (262), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 03:29:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 283 transitions. [2023-02-16 03:29:05,445 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 283 transitions. Word has length 25 [2023-02-16 03:29:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:05,446 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 283 transitions. [2023-02-16 03:29:05,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 283 transitions. [2023-02-16 03:29:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:29:05,446 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:05,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:05,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:05,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:05,654 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:05,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1612783879, now seen corresponding path program 1 times [2023-02-16 03:29:05,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:05,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289648655] [2023-02-16 03:29:05,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:05,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:05,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:05,656 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:05,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-16 03:29:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:05,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:29:05,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:05,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:05,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:05,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289648655] [2023-02-16 03:29:05,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289648655] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:05,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:05,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:29:05,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544488334] [2023-02-16 03:29:05,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:05,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:29:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:05,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:29:05,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:29:05,758 INFO L87 Difference]: Start difference. First operand 236 states and 283 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:05,820 INFO L93 Difference]: Finished difference Result 236 states and 282 transitions. [2023-02-16 03:29:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:29:05,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 27 [2023-02-16 03:29:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:05,822 INFO L225 Difference]: With dead ends: 236 [2023-02-16 03:29:05,822 INFO L226 Difference]: Without dead ends: 236 [2023-02-16 03:29:05,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:29:05,822 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 118 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:05,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 824 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:29:05,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-16 03:29:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2023-02-16 03:29:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 150 states have (on average 1.74) internal successors, (261), 219 states have internal predecessors, (261), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 03:29:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 282 transitions. [2023-02-16 03:29:05,827 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 282 transitions. Word has length 27 [2023-02-16 03:29:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:05,827 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 282 transitions. [2023-02-16 03:29:05,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 282 transitions. [2023-02-16 03:29:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:29:05,827 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:05,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:05,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:06,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:06,035 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash -405984592, now seen corresponding path program 1 times [2023-02-16 03:29:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:06,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449357145] [2023-02-16 03:29:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:06,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:06,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:06,037 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:06,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-16 03:29:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:06,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:29:06,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:06,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:29:06,204 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:29:06,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:29:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:06,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:06,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:06,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449357145] [2023-02-16 03:29:06,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449357145] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:06,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:06,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:29:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026051011] [2023-02-16 03:29:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:06,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:29:06,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:06,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:29:06,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:29:06,255 INFO L87 Difference]: Start difference. First operand 236 states and 282 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:29:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:06,871 INFO L93 Difference]: Finished difference Result 248 states and 290 transitions. [2023-02-16 03:29:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:29:06,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2023-02-16 03:29:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:06,873 INFO L225 Difference]: With dead ends: 248 [2023-02-16 03:29:06,873 INFO L226 Difference]: Without dead ends: 248 [2023-02-16 03:29:06,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:29:06,874 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 197 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:06,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 570 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 03:29:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-16 03:29:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 231. [2023-02-16 03:29:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 150 states have (on average 1.6733333333333333) internal successors, (251), 214 states have internal predecessors, (251), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 03:29:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2023-02-16 03:29:06,878 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 272 transitions. Word has length 33 [2023-02-16 03:29:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:06,879 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 272 transitions. [2023-02-16 03:29:06,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:29:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 272 transitions. [2023-02-16 03:29:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:29:06,879 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:06,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:06,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:07,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:07,088 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:07,088 INFO L85 PathProgramCache]: Analyzing trace with hash -405984591, now seen corresponding path program 1 times [2023-02-16 03:29:07,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:07,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118556772] [2023-02-16 03:29:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:07,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:07,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:07,090 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:07,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-16 03:29:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:07,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 03:29:07,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:07,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:29:07,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:29:07,284 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_198 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_198))))) is different from true [2023-02-16 03:29:07,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:29:07,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:29:07,318 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:29:07,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:29:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:07,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:07,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:07,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118556772] [2023-02-16 03:29:07,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118556772] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:07,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:07,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:29:07,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361387600] [2023-02-16 03:29:07,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:07,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:29:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:07,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:29:07,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2023-02-16 03:29:07,371 INFO L87 Difference]: Start difference. First operand 231 states and 272 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:29:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:07,977 INFO L93 Difference]: Finished difference Result 308 states and 337 transitions. [2023-02-16 03:29:07,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:29:07,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2023-02-16 03:29:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:07,979 INFO L225 Difference]: With dead ends: 308 [2023-02-16 03:29:07,979 INFO L226 Difference]: Without dead ends: 308 [2023-02-16 03:29:07,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2023-02-16 03:29:07,980 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 248 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:07,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 386 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 403 Invalid, 0 Unknown, 225 Unchecked, 0.6s Time] [2023-02-16 03:29:07,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-02-16 03:29:07,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 231. [2023-02-16 03:29:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 150 states have (on average 1.64) internal successors, (246), 214 states have internal predecessors, (246), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 03:29:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 267 transitions. [2023-02-16 03:29:07,984 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 267 transitions. Word has length 33 [2023-02-16 03:29:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:07,985 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 267 transitions. [2023-02-16 03:29:07,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:29:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 267 transitions. [2023-02-16 03:29:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:29:07,985 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:07,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:08,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:08,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:08,194 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:08,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:08,194 INFO L85 PathProgramCache]: Analyzing trace with hash -60324907, now seen corresponding path program 1 times [2023-02-16 03:29:08,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:08,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729050313] [2023-02-16 03:29:08,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:08,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:08,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:08,196 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:08,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-16 03:29:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:08,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:29:08,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:08,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:08,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:08,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729050313] [2023-02-16 03:29:08,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729050313] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:08,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:08,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:29:08,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202125524] [2023-02-16 03:29:08,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:08,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:29:08,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:08,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:29:08,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:29:08,585 INFO L87 Difference]: Start difference. First operand 231 states and 267 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:29:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:09,003 INFO L93 Difference]: Finished difference Result 229 states and 264 transitions. [2023-02-16 03:29:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:29:09,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2023-02-16 03:29:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:09,005 INFO L225 Difference]: With dead ends: 229 [2023-02-16 03:29:09,005 INFO L226 Difference]: Without dead ends: 229 [2023-02-16 03:29:09,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:29:09,005 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 404 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:09,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 695 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:29:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-16 03:29:09,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2023-02-16 03:29:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 150 states have (on average 1.62) internal successors, (243), 212 states have internal predecessors, (243), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 03:29:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 264 transitions. [2023-02-16 03:29:09,009 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 264 transitions. Word has length 36 [2023-02-16 03:29:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:09,009 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 264 transitions. [2023-02-16 03:29:09,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:29:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 264 transitions. [2023-02-16 03:29:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:29:09,010 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:09,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:09,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:09,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:09,220 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:09,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:09,221 INFO L85 PathProgramCache]: Analyzing trace with hash -60324935, now seen corresponding path program 1 times [2023-02-16 03:29:09,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:09,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073808544] [2023-02-16 03:29:09,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:09,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:09,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:09,223 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:09,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-16 03:29:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:09,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 03:29:09,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:09,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:09,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:09,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073808544] [2023-02-16 03:29:09,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073808544] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:09,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:09,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:29:09,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51316415] [2023-02-16 03:29:09,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:09,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:29:09,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:09,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:29:09,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:29:09,378 INFO L87 Difference]: Start difference. First operand 229 states and 264 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:09,394 INFO L93 Difference]: Finished difference Result 270 states and 308 transitions. [2023-02-16 03:29:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:29:09,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 36 [2023-02-16 03:29:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:09,396 INFO L225 Difference]: With dead ends: 270 [2023-02-16 03:29:09,396 INFO L226 Difference]: Without dead ends: 270 [2023-02-16 03:29:09,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:29:09,397 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 36 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:09,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 577 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:29:09,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-16 03:29:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 233. [2023-02-16 03:29:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 154 states have (on average 1.603896103896104) internal successors, (247), 216 states have internal predecessors, (247), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 03:29:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 268 transitions. [2023-02-16 03:29:09,404 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 268 transitions. Word has length 36 [2023-02-16 03:29:09,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:09,404 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 268 transitions. [2023-02-16 03:29:09,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 268 transitions. [2023-02-16 03:29:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:29:09,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:09,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:09,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-02-16 03:29:09,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:09,616 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:09,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:09,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1290023480, now seen corresponding path program 1 times [2023-02-16 03:29:09,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:09,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142158646] [2023-02-16 03:29:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:09,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:09,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:09,618 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:09,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-16 03:29:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:09,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 03:29:09,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:09,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:09,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:09,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142158646] [2023-02-16 03:29:09,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142158646] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:09,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:09,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:29:09,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934990399] [2023-02-16 03:29:09,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:09,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:29:09,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:09,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:29:09,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:29:09,761 INFO L87 Difference]: Start difference. First operand 233 states and 268 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:09,787 INFO L93 Difference]: Finished difference Result 256 states and 293 transitions. [2023-02-16 03:29:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:29:09,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 40 [2023-02-16 03:29:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:09,789 INFO L225 Difference]: With dead ends: 256 [2023-02-16 03:29:09,789 INFO L226 Difference]: Without dead ends: 256 [2023-02-16 03:29:09,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:29:09,791 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 43 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:09,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 575 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:29:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-02-16 03:29:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 235. [2023-02-16 03:29:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 156 states have (on average 1.5961538461538463) internal successors, (249), 218 states have internal predecessors, (249), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 03:29:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 270 transitions. [2023-02-16 03:29:09,795 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 270 transitions. Word has length 40 [2023-02-16 03:29:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:09,796 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 270 transitions. [2023-02-16 03:29:09,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 270 transitions. [2023-02-16 03:29:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:29:09,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:09,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:09,807 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 (16)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:10,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:10,005 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:10,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:10,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1533058511, now seen corresponding path program 1 times [2023-02-16 03:29:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:10,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400539789] [2023-02-16 03:29:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:10,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:10,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:10,008 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:10,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-16 03:29:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:10,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-16 03:29:10,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:10,291 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-16 03:29:10,292 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 4 case distinctions, treesize of input 26 treesize of output 43 [2023-02-16 03:29:10,584 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-16 03:29:10,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 40 [2023-02-16 03:29:10,904 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-16 03:29:10,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-02-16 03:29:11,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:29:11,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:29:11,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:29:11,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2023-02-16 03:29:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:11,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:11,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:11,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400539789] [2023-02-16 03:29:11,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400539789] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:11,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:11,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-02-16 03:29:11,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638107347] [2023-02-16 03:29:11,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:11,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 03:29:11,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:11,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 03:29:11,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:29:11,599 INFO L87 Difference]: Start difference. First operand 235 states and 270 transitions. Second operand has 17 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:29:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:18,010 INFO L93 Difference]: Finished difference Result 332 states and 366 transitions. [2023-02-16 03:29:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:29:18,010 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2023-02-16 03:29:18,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:18,011 INFO L225 Difference]: With dead ends: 332 [2023-02-16 03:29:18,011 INFO L226 Difference]: Without dead ends: 332 [2023-02-16 03:29:18,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2023-02-16 03:29:18,012 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 576 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 53 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:18,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 891 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1293 Invalid, 16 Unknown, 0 Unchecked, 2.7s Time] [2023-02-16 03:29:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-02-16 03:29:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 257. [2023-02-16 03:29:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 176 states have (on average 1.5909090909090908) internal successors, (280), 236 states have internal predecessors, (280), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2023-02-16 03:29:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 304 transitions. [2023-02-16 03:29:18,016 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 304 transitions. Word has length 42 [2023-02-16 03:29:18,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:18,016 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 304 transitions. [2023-02-16 03:29:18,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:29:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 304 transitions. [2023-02-16 03:29:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:29:18,017 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:18,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:18,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:18,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:18,225 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:18,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1533058512, now seen corresponding path program 1 times [2023-02-16 03:29:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:18,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654548092] [2023-02-16 03:29:18,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:18,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:18,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:18,227 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:18,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-16 03:29:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:18,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-16 03:29:18,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:18,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:29:18,454 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 12 treesize of output 14 [2023-02-16 03:29:18,478 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-02-16 03:29:18,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-16 03:29:18,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:29:18,630 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 12 treesize of output 14 [2023-02-16 03:29:18,729 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:29:18,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:29:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:18,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:18,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:18,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654548092] [2023-02-16 03:29:18,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654548092] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:18,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:18,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 03:29:18,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491354560] [2023-02-16 03:29:18,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:18,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:29:18,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:18,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:29:18,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2023-02-16 03:29:18,866 INFO L87 Difference]: Start difference. First operand 257 states and 304 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:29:21,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:29:23,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-16 03:29:25,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:29:27,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:29:29,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:29:31,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-16 03:29:34,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-16 03:29:36,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:29:38,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:29:41,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:29:43,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:29:45,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:29:47,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:29:51,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:29:53,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:29:56,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-16 03:29:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:56,035 INFO L93 Difference]: Finished difference Result 295 states and 334 transitions. [2023-02-16 03:29:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:29:56,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2023-02-16 03:29:56,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:56,036 INFO L225 Difference]: With dead ends: 295 [2023-02-16 03:29:56,036 INFO L226 Difference]: Without dead ends: 295 [2023-02-16 03:29:56,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=98, Invalid=361, Unknown=3, NotChecked=0, Total=462 [2023-02-16 03:29:56,037 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 564 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 72 mSolverCounterUnsat, 57 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 57 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:56,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 489 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1177 Invalid, 57 Unknown, 0 Unchecked, 34.7s Time] [2023-02-16 03:29:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-16 03:29:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 255. [2023-02-16 03:29:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 176 states have (on average 1.5681818181818181) internal successors, (276), 234 states have internal predecessors, (276), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2023-02-16 03:29:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 300 transitions. [2023-02-16 03:29:56,041 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 300 transitions. Word has length 42 [2023-02-16 03:29:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:56,041 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 300 transitions. [2023-02-16 03:29:56,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:29:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 300 transitions. [2023-02-16 03:29:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:29:56,042 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:56,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:56,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:56,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:56,264 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:56,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:56,265 INFO L85 PathProgramCache]: Analyzing trace with hash -974113632, now seen corresponding path program 1 times [2023-02-16 03:29:56,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:56,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992130977] [2023-02-16 03:29:56,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:56,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:56,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:56,266 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:56,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-16 03:29:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:56,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:29:56,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:56,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:29:56,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:29:56,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:29:56,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2023-02-16 03:29:56,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2023-02-16 03:29:56,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2023-02-16 03:29:56,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2023-02-16 03:29:56,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:29:56,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 14 [2023-02-16 03:29:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:56,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:56,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:56,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992130977] [2023-02-16 03:29:56,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992130977] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:56,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:56,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:29:56,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449777146] [2023-02-16 03:29:56,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:56,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:29:56,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:29:56,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:29:56,720 INFO L87 Difference]: Start difference. First operand 255 states and 300 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:57,153 INFO L93 Difference]: Finished difference Result 281 states and 330 transitions. [2023-02-16 03:29:57,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:29:57,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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 43 [2023-02-16 03:29:57,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:57,155 INFO L225 Difference]: With dead ends: 281 [2023-02-16 03:29:57,155 INFO L226 Difference]: Without dead ends: 281 [2023-02-16 03:29:57,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:29:57,155 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 160 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:57,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 587 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:29:57,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-02-16 03:29:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 254. [2023-02-16 03:29:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 233 states have internal predecessors, (274), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2023-02-16 03:29:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 298 transitions. [2023-02-16 03:29:57,159 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 298 transitions. Word has length 43 [2023-02-16 03:29:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:57,160 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 298 transitions. [2023-02-16 03:29:57,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:57,160 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 298 transitions. [2023-02-16 03:29:57,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:29:57,160 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:57,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:57,174 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 (19)] Ended with exit code 0 [2023-02-16 03:29:57,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:57,370 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:57,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:57,371 INFO L85 PathProgramCache]: Analyzing trace with hash 280193697, now seen corresponding path program 1 times [2023-02-16 03:29:57,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:57,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528870891] [2023-02-16 03:29:57,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:57,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:57,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:57,372 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:57,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-16 03:29:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:57,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 03:29:57,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:57,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:57,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:57,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528870891] [2023-02-16 03:29:57,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528870891] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:57,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:57,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:29:57,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138725694] [2023-02-16 03:29:57,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:57,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:29:57,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:57,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:29:57,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:29:57,505 INFO L87 Difference]: Start difference. First operand 254 states and 298 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:57,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:57,524 INFO L93 Difference]: Finished difference Result 276 states and 319 transitions. [2023-02-16 03:29:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:29:57,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 43 [2023-02-16 03:29:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:57,525 INFO L225 Difference]: With dead ends: 276 [2023-02-16 03:29:57,525 INFO L226 Difference]: Without dead ends: 276 [2023-02-16 03:29:57,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:29:57,526 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 47 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:57,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 556 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:29:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-02-16 03:29:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 256. [2023-02-16 03:29:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 178 states have (on average 1.5449438202247192) internal successors, (275), 235 states have internal predecessors, (275), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2023-02-16 03:29:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 299 transitions. [2023-02-16 03:29:57,532 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 299 transitions. Word has length 43 [2023-02-16 03:29:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:57,532 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 299 transitions. [2023-02-16 03:29:57,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 299 transitions. [2023-02-16 03:29:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 03:29:57,548 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:57,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:57,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:57,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:57,749 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:57,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:57,750 INFO L85 PathProgramCache]: Analyzing trace with hash -132751331, now seen corresponding path program 1 times [2023-02-16 03:29:57,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:57,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592681445] [2023-02-16 03:29:57,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:57,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:57,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:57,751 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:57,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-16 03:29:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:57,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:29:57,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:57,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:29:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:58,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:58,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:58,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592681445] [2023-02-16 03:29:58,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592681445] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:58,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:58,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:29:58,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549787766] [2023-02-16 03:29:58,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:58,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:29:58,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:58,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:29:58,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:29:58,010 INFO L87 Difference]: Start difference. First operand 256 states and 299 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:29:58,794 INFO L93 Difference]: Finished difference Result 317 states and 356 transitions. [2023-02-16 03:29:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:29:58,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 44 [2023-02-16 03:29:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:29:58,796 INFO L225 Difference]: With dead ends: 317 [2023-02-16 03:29:58,796 INFO L226 Difference]: Without dead ends: 317 [2023-02-16 03:29:58,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:29:58,796 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 123 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:29:58,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 812 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 03:29:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-02-16 03:29:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 255. [2023-02-16 03:29:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 234 states have internal predecessors, (272), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2023-02-16 03:29:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 296 transitions. [2023-02-16 03:29:58,807 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 296 transitions. Word has length 44 [2023-02-16 03:29:58,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:29:58,808 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 296 transitions. [2023-02-16 03:29:58,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:29:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 296 transitions. [2023-02-16 03:29:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 03:29:58,808 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:29:58,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:29:58,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-16 03:29:59,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:59,013 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:29:59,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:29:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash -132751330, now seen corresponding path program 1 times [2023-02-16 03:29:59,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:29:59,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388583] [2023-02-16 03:29:59,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:29:59,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:29:59,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:29:59,015 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:29:59,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-16 03:29:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:29:59,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 03:29:59,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:29:59,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:29:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:29:59,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:29:59,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:29:59,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388583] [2023-02-16 03:29:59,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388583] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:29:59,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:29:59,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:29:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784643210] [2023-02-16 03:29:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:29:59,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:29:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:29:59,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:29:59,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:29:59,313 INFO L87 Difference]: Start difference. First operand 255 states and 296 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:30:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:30:00,324 INFO L93 Difference]: Finished difference Result 348 states and 390 transitions. [2023-02-16 03:30:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:30:00,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 44 [2023-02-16 03:30:00,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:30:00,326 INFO L225 Difference]: With dead ends: 348 [2023-02-16 03:30:00,326 INFO L226 Difference]: Without dead ends: 348 [2023-02-16 03:30:00,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:30:00,327 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 138 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:30:00,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 834 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-16 03:30:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-02-16 03:30:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 255. [2023-02-16 03:30:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 178 states have (on average 1.5168539325842696) internal successors, (270), 234 states have internal predecessors, (270), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2023-02-16 03:30:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 294 transitions. [2023-02-16 03:30:00,332 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 294 transitions. Word has length 44 [2023-02-16 03:30:00,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:30:00,333 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 294 transitions. [2023-02-16 03:30:00,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:30:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 294 transitions. [2023-02-16 03:30:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 03:30:00,333 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:30:00,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:30:00,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-02-16 03:30:00,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:30:00,569 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:30:00,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:30:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1335876523, now seen corresponding path program 1 times [2023-02-16 03:30:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:30:00,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133643984] [2023-02-16 03:30:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:30:00,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:30:00,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:30:00,574 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:30:00,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-16 03:30:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:30:00,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-16 03:30:00,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:30:00,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:30:00,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:30:01,003 INFO L321 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2023-02-16 03:30:01,003 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 23 treesize of output 35 [2023-02-16 03:30:01,036 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 11 treesize of output 5 [2023-02-16 03:30:01,144 INFO L321 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2023-02-16 03:30:01,145 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 23 treesize of output 35 [2023-02-16 03:30:01,280 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:30:01,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2023-02-16 03:30:01,543 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:30:01,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 82 [2023-02-16 03:30:01,924 INFO L321 Elim1Store]: treesize reduction 107, result has 29.6 percent of original size [2023-02-16 03:30:01,925 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 4 case distinctions, treesize of input 58 treesize of output 92 [2023-02-16 03:30:02,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:30:02,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2023-02-16 03:30:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:30:02,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:30:02,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:30:02,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133643984] [2023-02-16 03:30:02,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133643984] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:30:02,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:30:02,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-16 03:30:02,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955623526] [2023-02-16 03:30:02,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:30:02,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 03:30:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:30:02,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 03:30:02,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2023-02-16 03:30:02,288 INFO L87 Difference]: Start difference. First operand 255 states and 294 transitions. Second operand has 22 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:30:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:30:05,950 INFO L93 Difference]: Finished difference Result 315 states and 357 transitions. [2023-02-16 03:30:05,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 03:30:05,950 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2023-02-16 03:30:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:30:05,951 INFO L225 Difference]: With dead ends: 315 [2023-02-16 03:30:05,951 INFO L226 Difference]: Without dead ends: 315 [2023-02-16 03:30:05,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=228, Invalid=1254, Unknown=0, NotChecked=0, Total=1482 [2023-02-16 03:30:05,952 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 452 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:30:05,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1232 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-02-16 03:30:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-02-16 03:30:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 276. [2023-02-16 03:30:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 197 states have (on average 1.4923857868020305) internal successors, (294), 254 states have internal predecessors, (294), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2023-02-16 03:30:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 321 transitions. [2023-02-16 03:30:05,960 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 321 transitions. Word has length 45 [2023-02-16 03:30:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:30:05,960 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 321 transitions. [2023-02-16 03:30:05,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:30:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 321 transitions. [2023-02-16 03:30:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 03:30:05,961 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:30:05,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:30:05,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-16 03:30:06,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:30:06,161 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:30:06,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:30:06,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1335876522, now seen corresponding path program 1 times [2023-02-16 03:30:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:30:06,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462497443] [2023-02-16 03:30:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:30:06,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:30:06,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:30:06,165 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:30:06,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-16 03:30:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:30:06,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-16 03:30:06,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:30:06,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:30:06,647 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-16 03:30:06,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-02-16 03:30:07,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:30:07,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:30:07,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:30:07,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:30:07,190 INFO L321 Elim1Store]: treesize reduction 78, result has 35.0 percent of original size [2023-02-16 03:30:07,190 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 37 treesize of output 67 [2023-02-16 03:30:07,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2023-02-16 03:30:07,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2023-02-16 03:30:07,663 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:30:07,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-16 03:30:07,706 INFO L321 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2023-02-16 03:30:07,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 35 [2023-02-16 03:30:08,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:30:08,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2023-02-16 03:30:08,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2023-02-16 03:30:08,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:30:10,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-02-16 03:30:10,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-16 03:30:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:30:10,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:30:10,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:30:10,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462497443] [2023-02-16 03:30:10,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462497443] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:30:10,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:30:10,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-16 03:30:10,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116426040] [2023-02-16 03:30:10,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:30:10,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 03:30:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:30:10,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 03:30:10,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2023-02-16 03:30:10,524 INFO L87 Difference]: Start difference. First operand 276 states and 321 transitions. Second operand has 22 states, 18 states have (on average 2.111111111111111) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:30:18,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:30:30,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:30:32,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:30:34,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:30:36,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:30:39,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:30:41,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:30:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:30:43,693 INFO L93 Difference]: Finished difference Result 365 states and 400 transitions. [2023-02-16 03:30:43,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-16 03:30:43,693 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.111111111111111) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2023-02-16 03:30:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:30:43,695 INFO L225 Difference]: With dead ends: 365 [2023-02-16 03:30:43,695 INFO L226 Difference]: Without dead ends: 365 [2023-02-16 03:30:43,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=185, Invalid=1375, Unknown=0, NotChecked=0, Total=1560 [2023-02-16 03:30:43,695 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 560 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 56 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:30:43,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1106 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2040 Invalid, 3 Unknown, 0 Unchecked, 18.5s Time] [2023-02-16 03:30:43,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-02-16 03:30:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 310. [2023-02-16 03:30:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 224 states have (on average 1.5267857142857142) internal successors, (342), 284 states have internal predecessors, (342), 14 states have call successors, (14), 12 states have call predecessors, (14), 14 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2023-02-16 03:30:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 375 transitions. [2023-02-16 03:30:43,700 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 375 transitions. Word has length 45 [2023-02-16 03:30:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:30:43,701 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 375 transitions. [2023-02-16 03:30:43,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.111111111111111) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:30:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 375 transitions. [2023-02-16 03:30:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 03:30:43,701 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:30:43,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:30:43,710 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 (24)] Ended with exit code 0 [2023-02-16 03:30:43,909 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 [2023-02-16 03:30:43,910 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:30:43,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:30:43,910 INFO L85 PathProgramCache]: Analyzing trace with hash 417882070, now seen corresponding path program 1 times [2023-02-16 03:30:43,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:30:43,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396479935] [2023-02-16 03:30:43,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:30:43,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:30:43,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:30:43,911 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:30:43,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-16 03:30:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:30:44,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-16 03:30:44,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:30:44,258 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-16 03:30:44,258 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 24 treesize of output 41 [2023-02-16 03:30:44,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:30:44,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:30:44,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:30:44,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 03:30:44,780 INFO L321 Elim1Store]: treesize reduction 56, result has 44.0 percent of original size [2023-02-16 03:30:44,780 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 4 case distinctions, treesize of input 38 treesize of output 72 [2023-02-16 03:30:44,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-16 03:30:45,047 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-16 03:30:45,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-02-16 03:30:45,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:30:45,192 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:30:45,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 40 [2023-02-16 03:30:45,264 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:30:45,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 40 [2023-02-16 03:30:45,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:30:45,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:30:45,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:30:45,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 21 [2023-02-16 03:30:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:30:45,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:30:45,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:30:45,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396479935] [2023-02-16 03:30:45,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396479935] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:30:45,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:30:45,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2023-02-16 03:30:45,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022540360] [2023-02-16 03:30:45,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:30:45,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-16 03:30:45,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:30:45,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-16 03:30:45,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2023-02-16 03:30:45,674 INFO L87 Difference]: Start difference. First operand 310 states and 375 transitions. Second operand has 27 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:30:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:30:49,872 INFO L93 Difference]: Finished difference Result 358 states and 398 transitions. [2023-02-16 03:30:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-16 03:30:49,872 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2023-02-16 03:30:49,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:30:49,873 INFO L225 Difference]: With dead ends: 358 [2023-02-16 03:30:49,873 INFO L226 Difference]: Without dead ends: 358 [2023-02-16 03:30:49,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=257, Invalid=2095, Unknown=0, NotChecked=0, Total=2352 [2023-02-16 03:30:49,874 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 555 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 2369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:30:49,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1835 Invalid, 2369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-02-16 03:30:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-02-16 03:30:49,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 313. [2023-02-16 03:30:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 227 states have (on average 1.524229074889868) internal successors, (346), 286 states have internal predecessors, (346), 14 states have call successors, (14), 12 states have call predecessors, (14), 14 states have return successors, (19), 14 states have call predecessors, (19), 14 states have call successors, (19) [2023-02-16 03:30:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 379 transitions. [2023-02-16 03:30:49,880 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 379 transitions. Word has length 47 [2023-02-16 03:30:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:30:49,880 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 379 transitions. [2023-02-16 03:30:49,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:30:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 379 transitions. [2023-02-16 03:30:49,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 03:30:49,884 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:30:49,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:30:49,895 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 (25)] Ended with exit code 0 [2023-02-16 03:30:50,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:30:50,093 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting free_reportsErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:30:50,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:30:50,093 INFO L85 PathProgramCache]: Analyzing trace with hash 417882071, now seen corresponding path program 1 times [2023-02-16 03:30:50,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:30:50,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745162086] [2023-02-16 03:30:50,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:30:50,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:30:50,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:30:50,095 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:30:50,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-16 03:30:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:30:50,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 80 conjunts are in the unsatisfiable core [2023-02-16 03:30:50,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:30:50,445 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:30:50,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:30:50,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:30:50,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:30:50,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:30:50,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:30:50,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 03:30:50,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-16 03:30:50,931 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-16 03:30:50,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 36 [2023-02-16 03:30:50,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-16 03:30:51,165 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-16 03:30:51,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-02-16 03:30:51,415 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:30:51,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 49 [2023-02-16 03:30:51,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 30 [2023-02-16 03:30:51,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 30 [2023-02-16 03:30:51,581 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:30:51,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 49 [2023-02-16 03:30:52,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:30:52,129 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:30:52,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:30:52,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 48 [2023-02-16 03:30:52,139 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:30:52,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 25 [2023-02-16 03:30:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:30:52,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:30:52,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:30:52,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745162086] [2023-02-16 03:30:52,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745162086] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:30:52,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:30:52,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2023-02-16 03:30:52,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145347520] [2023-02-16 03:30:52,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:30:52,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 03:30:52,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:30:52,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 03:30:52,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2023-02-16 03:30:52,221 INFO L87 Difference]: Start difference. First operand 313 states and 379 transitions. Second operand has 26 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:30:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:30:56,021 INFO L93 Difference]: Finished difference Result 342 states and 376 transitions. [2023-02-16 03:30:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-16 03:30:56,021 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2023-02-16 03:30:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:30:56,027 INFO L225 Difference]: With dead ends: 342 [2023-02-16 03:30:56,027 INFO L226 Difference]: Without dead ends: 342 [2023-02-16 03:30:56,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=254, Invalid=1816, Unknown=0, NotChecked=0, Total=2070 [2023-02-16 03:30:56,029 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 465 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:30:56,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1581 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-02-16 03:30:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-02-16 03:30:56,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 291. [2023-02-16 03:30:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 209 states have (on average 1.4880382775119618) internal successors, (311), 266 states have internal predecessors, (311), 12 states have call successors, (12), 11 states have call predecessors, (12), 12 states have return successors, (16), 13 states have call predecessors, (16), 12 states have call successors, (16) [2023-02-16 03:30:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 339 transitions. [2023-02-16 03:30:56,033 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 339 transitions. Word has length 47 [2023-02-16 03:30:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:30:56,033 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 339 transitions. [2023-02-16 03:30:56,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:30:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 339 transitions. [2023-02-16 03:30:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 03:30:56,034 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:30:56,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:30:56,063 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 (26)] Ended with exit code 0 [2023-02-16 03:30:56,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:30:56,243 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:30:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:30:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash 870106982, now seen corresponding path program 1 times [2023-02-16 03:30:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:30:56,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756706204] [2023-02-16 03:30:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:30:56,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:30:56,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:30:56,245 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:30:56,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-16 03:30:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:30:56,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-16 03:30:56,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:30:56,747 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-16 03:30:56,748 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 4 case distinctions, treesize of input 31 treesize of output 53 [2023-02-16 03:30:57,034 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:30:57,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 42 [2023-02-16 03:30:57,188 INFO L321 Elim1Store]: treesize reduction 118, result has 27.6 percent of original size [2023-02-16 03:30:57,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 73 [2023-02-16 03:30:57,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:30:57,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-16 03:30:57,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:30:58,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:30:58,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:30:58,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:30:59,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:30:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:30:59,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:30:59,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:30:59,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756706204] [2023-02-16 03:30:59,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756706204] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:30:59,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:30:59,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-16 03:30:59,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545585626] [2023-02-16 03:30:59,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:30:59,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 03:30:59,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:30:59,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 03:30:59,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:30:59,532 INFO L87 Difference]: Start difference. First operand 291 states and 339 transitions. Second operand has 19 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:31:12,152 WARN L233 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 91 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:31:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:31:25,486 INFO L93 Difference]: Finished difference Result 458 states and 514 transitions. [2023-02-16 03:31:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-16 03:31:25,487 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2023-02-16 03:31:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:31:25,488 INFO L225 Difference]: With dead ends: 458 [2023-02-16 03:31:25,488 INFO L226 Difference]: Without dead ends: 458 [2023-02-16 03:31:25,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=275, Invalid=1131, Unknown=0, NotChecked=0, Total=1406 [2023-02-16 03:31:25,489 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 1544 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 140 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:31:25,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 1070 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1890 Invalid, 11 Unknown, 0 Unchecked, 8.1s Time] [2023-02-16 03:31:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-02-16 03:31:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 316. [2023-02-16 03:31:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 235 states have (on average 1.4851063829787234) internal successors, (349), 290 states have internal predecessors, (349), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2023-02-16 03:31:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 379 transitions. [2023-02-16 03:31:25,495 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 379 transitions. Word has length 47 [2023-02-16 03:31:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:31:25,495 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 379 transitions. [2023-02-16 03:31:25,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:31:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 379 transitions. [2023-02-16 03:31:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 03:31:25,496 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:31:25,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:31:25,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-16 03:31:25,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:31:25,696 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:31:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:31:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash 870106983, now seen corresponding path program 1 times [2023-02-16 03:31:25,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:31:25,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355702448] [2023-02-16 03:31:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:31:25,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:31:25,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:31:25,698 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:31:25,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-02-16 03:31:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:31:26,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-16 03:31:26,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:31:26,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:31:26,246 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 12 treesize of output 14 [2023-02-16 03:31:26,266 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-02-16 03:31:26,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-16 03:31:26,483 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 7 [2023-02-16 03:31:26,501 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:31:26,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-16 03:31:26,666 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:31:26,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:31:26,698 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:31:26,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:31:26,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:31:26,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:31:27,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-16 03:31:27,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-16 03:31:27,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:31:27,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:31:27,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:31:27,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:31:27,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:31:27,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:31:27,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:31:27,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:31:28,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:31:28,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:31:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:31:28,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:31:28,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:31:28,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355702448] [2023-02-16 03:31:28,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355702448] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:31:28,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:31:28,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-16 03:31:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554662783] [2023-02-16 03:31:28,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:31:28,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 03:31:28,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:31:28,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 03:31:28,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=297, Unknown=7, NotChecked=0, Total=342 [2023-02-16 03:31:28,119 INFO L87 Difference]: Start difference. First operand 316 states and 379 transitions. Second operand has 19 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:31:34,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:31:36,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:31:38,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-16 03:31:41,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:31:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:31:47,975 INFO L93 Difference]: Finished difference Result 578 states and 654 transitions. [2023-02-16 03:31:47,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-16 03:31:47,976 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2023-02-16 03:31:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:31:47,978 INFO L225 Difference]: With dead ends: 578 [2023-02-16 03:31:47,978 INFO L226 Difference]: Without dead ends: 578 [2023-02-16 03:31:47,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=487, Invalid=2050, Unknown=13, NotChecked=0, Total=2550 [2023-02-16 03:31:47,979 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 1904 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 169 mSolverCounterUnsat, 88 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 88 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:31:47,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 961 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2480 Invalid, 88 Unknown, 0 Unchecked, 15.2s Time] [2023-02-16 03:31:47,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2023-02-16 03:31:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 315. [2023-02-16 03:31:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 235 states have (on average 1.4680851063829787) internal successors, (345), 289 states have internal predecessors, (345), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2023-02-16 03:31:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 375 transitions. [2023-02-16 03:31:47,985 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 375 transitions. Word has length 47 [2023-02-16 03:31:47,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:31:47,985 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 375 transitions. [2023-02-16 03:31:47,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:31:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 375 transitions. [2023-02-16 03:31:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 03:31:47,986 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:31:47,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:31:48,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 (28)] Forceful destruction successful, exit code 0 [2023-02-16 03:31:48,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:31:48,199 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:31:48,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:31:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1345808633, now seen corresponding path program 1 times [2023-02-16 03:31:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:31:48,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211679495] [2023-02-16 03:31:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:31:48,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:31:48,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:31:48,202 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:31:48,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-16 03:31:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:31:48,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 72 conjunts are in the unsatisfiable core [2023-02-16 03:31:48,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:31:48,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:31:49,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:31:49,074 INFO L321 Elim1Store]: treesize reduction 70, result has 30.7 percent of original size [2023-02-16 03:31:49,074 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 5 case distinctions, treesize of input 30 treesize of output 51 [2023-02-16 03:31:49,146 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-16 03:31:49,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-16 03:31:49,449 INFO L321 Elim1Store]: treesize reduction 92, result has 31.3 percent of original size [2023-02-16 03:31:49,449 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 7 case distinctions, treesize of input 37 treesize of output 67 [2023-02-16 03:31:49,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2023-02-16 03:31:49,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:31:49,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2023-02-16 03:31:50,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-16 03:31:50,394 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:31:50,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:31:50,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:31:50,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:31:50,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:31:50,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2023-02-16 03:31:50,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:31:50,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:31:50,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2023-02-16 03:31:50,609 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:31:50,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:31:50,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:31:50,745 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:31:50,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:31:50,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:31:50,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:31:50,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:31:50,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2023-02-16 03:31:50,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:31:50,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:31:50,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2023-02-16 03:31:50,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:31:50,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:31:52,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:31:52,656 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-16 03:31:52,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 32 [2023-02-16 03:31:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:31:52,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:31:52,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:31:52,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211679495] [2023-02-16 03:31:52,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211679495] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:31:52,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:31:52,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-02-16 03:31:52,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11454644] [2023-02-16 03:31:52,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:31:52,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 03:31:52,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:31:52,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 03:31:52,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2023-02-16 03:31:52,940 INFO L87 Difference]: Start difference. First operand 315 states and 375 transitions. Second operand has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:31:57,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-16 03:32:14,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:32:17,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:32:21,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:32:28,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:32:34,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:34,690 INFO L93 Difference]: Finished difference Result 488 states and 553 transitions. [2023-02-16 03:32:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-16 03:32:34,692 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2023-02-16 03:32:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:34,694 INFO L225 Difference]: With dead ends: 488 [2023-02-16 03:32:34,694 INFO L226 Difference]: Without dead ends: 488 [2023-02-16 03:32:34,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=517, Invalid=1933, Unknown=0, NotChecked=0, Total=2450 [2023-02-16 03:32:34,694 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 1451 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 129 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:34,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 1678 Invalid, 2636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2494 Invalid, 13 Unknown, 0 Unchecked, 25.9s Time] [2023-02-16 03:32:34,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-02-16 03:32:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 330. [2023-02-16 03:32:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 247 states have (on average 1.4534412955465588) internal successors, (359), 302 states have internal predecessors, (359), 14 states have call successors, (14), 13 states have call predecessors, (14), 14 states have return successors, (19), 14 states have call predecessors, (19), 14 states have call successors, (19) [2023-02-16 03:32:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 392 transitions. [2023-02-16 03:32:34,700 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 392 transitions. Word has length 49 [2023-02-16 03:32:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:34,700 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 392 transitions. [2023-02-16 03:32:34,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:32:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 392 transitions. [2023-02-16 03:32:34,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 03:32:34,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:34,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:34,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-16 03:32:34,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:32:34,901 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-02-16 03:32:34,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1345808632, now seen corresponding path program 1 times [2023-02-16 03:32:34,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:32:34,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582057953] [2023-02-16 03:32:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:34,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:32:34,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:32:34,903 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:32:34,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-16 03:32:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:35,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 109 conjunts are in the unsatisfiable core [2023-02-16 03:32:35,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:32:35,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:32:35,684 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-16 03:32:35,684 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 4 case distinctions, treesize of input 26 treesize of output 43 [2023-02-16 03:32:36,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:32:36,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:32:36,216 INFO L321 Elim1Store]: treesize reduction 78, result has 35.0 percent of original size [2023-02-16 03:32:36,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 67 [2023-02-16 03:32:36,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:32:36,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-16 03:32:36,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:36,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:36,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:36,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-16 03:32:36,788 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:32:36,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-16 03:32:36,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:36,843 INFO L321 Elim1Store]: treesize reduction 58, result has 26.6 percent of original size [2023-02-16 03:32:36,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 44 [2023-02-16 03:32:37,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2023-02-16 03:32:37,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 03:32:37,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2023-02-16 03:32:37,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:37,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:37,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:37,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:37,934 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:32:37,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 78 [2023-02-16 03:32:37,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:37,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:37,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:37,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:37,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:37,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2023-02-16 03:32:38,577 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-16 03:32:38,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2023-02-16 03:32:38,616 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:32:38,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2023-02-16 03:32:38,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-02-16 03:32:38,770 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-16 03:32:38,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2023-02-16 03:32:38,800 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:32:38,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2023-02-16 03:32:38,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-02-16 03:32:39,032 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:32:39,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2023-02-16 03:32:39,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:39,077 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:32:39,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2023-02-16 03:32:39,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-02-16 03:32:39,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-02-16 03:32:39,318 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:32:39,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2023-02-16 03:32:39,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:39,342 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:32:39,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2023-02-16 03:32:41,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2023-02-16 03:32:41,405 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-02-16 03:32:41,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 52 [2023-02-16 03:32:41,436 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:32:41,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-16 03:32:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:32:41,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:32:41,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:32:41,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582057953] [2023-02-16 03:32:41,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582057953] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:41,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:41,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2023-02-16 03:32:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130613755] [2023-02-16 03:32:41,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:41,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-16 03:32:41,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:32:41,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-16 03:32:41,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2023-02-16 03:32:41,784 INFO L87 Difference]: Start difference. First operand 330 states and 392 transitions. Second operand has 29 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:33:19,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:33:21,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:33:24,140 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]