./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test6_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 7f731faf9d41ed60f5858e3dbd50ffba002d2a56a92297f4715b69207f896c11 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 03:10:29,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 03:10:29,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 03:10:29,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 03:10:29,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 03:10:29,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 03:10:29,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 03:10:29,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 03:10:29,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 03:10:29,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 03:10:29,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 03:10:29,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 03:10:29,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 03:10:29,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 03:10:29,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 03:10:29,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 03:10:29,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 03:10:29,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 03:10:29,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 03:10:29,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 03:10:29,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 03:10:29,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 03:10:29,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 03:10:29,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 03:10:29,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 03:10:29,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 03:10:29,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 03:10:29,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 03:10:29,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 03:10:29,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 03:10:29,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 03:10:29,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 03:10:29,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 03:10:29,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 03:10:29,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 03:10:29,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 03:10:29,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 03:10:29,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 03:10:29,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 03:10:29,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 03:10:29,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 03:10:29,638 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 03:10:29,665 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 03:10:29,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 03:10:29,666 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 03:10:29,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 03:10:29,667 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 03:10:29,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 03:10:29,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 03:10:29,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 03:10:29,668 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 03:10:29,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 03:10:29,670 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 03:10:29,670 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 03:10:29,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 03:10:29,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 03:10:29,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 03:10:29,671 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 03:10:29,671 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 03:10:29,671 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 03:10:29,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 03:10:29,671 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 03:10:29,672 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 03:10:29,672 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 03:10:29,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 03:10:29,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 03:10:29,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 03:10:29,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:10:29,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 03:10:29,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 03:10:29,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 03:10:29,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 03:10:29,674 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 03:10:29,674 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 03:10:29,674 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 03:10:29,674 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 03:10:29,674 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 -> 7f731faf9d41ed60f5858e3dbd50ffba002d2a56a92297f4715b69207f896c11 [2023-02-17 03:10:29,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 03:10:29,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 03:10:29,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 03:10:29,947 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 03:10:29,947 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 03:10:29,948 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2023-02-17 03:10:31,091 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 03:10:31,340 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 03:10:31,340 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2023-02-17 03:10:31,358 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ba1758a/73e5202f38d841399d26a52382985eb5/FLAGa7179e0a3 [2023-02-17 03:10:31,373 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ba1758a/73e5202f38d841399d26a52382985eb5 [2023-02-17 03:10:31,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 03:10:31,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 03:10:31,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 03:10:31,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 03:10:31,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 03:10:31,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:10:31" (1/1) ... [2023-02-17 03:10:31,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff6e424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:31, skipping insertion in model container [2023-02-17 03:10:31,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:10:31" (1/1) ... [2023-02-17 03:10:31,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 03:10:31,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:10:31,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:10:31,779 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-17 03:10:31,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1569ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:31, skipping insertion in model container [2023-02-17 03:10:31,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 03:10:31,782 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-17 03:10:31,784 INFO L158 Benchmark]: Toolchain (without parser) took 405.48ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 96.2MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 03:10:31,784 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 03:10:31,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.53ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 96.2MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 03:10:31,786 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.19ms. Allocated memory is still 113.2MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.53ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 96.2MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test6_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 7f731faf9d41ed60f5858e3dbd50ffba002d2a56a92297f4715b69207f896c11 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 03:10:33,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 03:10:33,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 03:10:33,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 03:10:33,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 03:10:33,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 03:10:33,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 03:10:33,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 03:10:33,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 03:10:33,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 03:10:33,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 03:10:33,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 03:10:33,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 03:10:33,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 03:10:33,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 03:10:33,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 03:10:33,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 03:10:33,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 03:10:33,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 03:10:33,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 03:10:33,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 03:10:33,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 03:10:33,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 03:10:33,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 03:10:33,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 03:10:33,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 03:10:33,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 03:10:33,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 03:10:33,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 03:10:33,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 03:10:33,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 03:10:33,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 03:10:33,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 03:10:33,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 03:10:33,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 03:10:33,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 03:10:33,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 03:10:33,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 03:10:33,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 03:10:33,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 03:10:33,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 03:10:33,851 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-17 03:10:33,885 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 03:10:33,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 03:10:33,886 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 03:10:33,886 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 03:10:33,887 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 03:10:33,887 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 03:10:33,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 03:10:33,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 03:10:33,888 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 03:10:33,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 03:10:33,889 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 03:10:33,889 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 03:10:33,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 03:10:33,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 03:10:33,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 03:10:33,890 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 03:10:33,890 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 03:10:33,891 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 03:10:33,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 03:10:33,891 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 03:10:33,891 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 03:10:33,891 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 03:10:33,892 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 03:10:33,892 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 03:10:33,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 03:10:33,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 03:10:33,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 03:10:33,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:10:33,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 03:10:33,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 03:10:33,893 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 03:10:33,893 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 03:10:33,894 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 03:10:33,894 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 03:10:33,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 03:10:33,894 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 03:10:33,895 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 03:10:33,895 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 -> 7f731faf9d41ed60f5858e3dbd50ffba002d2a56a92297f4715b69207f896c11 [2023-02-17 03:10:34,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 03:10:34,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 03:10:34,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 03:10:34,212 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 03:10:34,212 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 03:10:34,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2023-02-17 03:10:35,370 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 03:10:35,575 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 03:10:35,576 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2023-02-17 03:10:35,598 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af440be57/f7cd15a65b874b60be1fe2e632be4d83/FLAG790c41e0d [2023-02-17 03:10:35,612 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af440be57/f7cd15a65b874b60be1fe2e632be4d83 [2023-02-17 03:10:35,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 03:10:35,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 03:10:35,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 03:10:35,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 03:10:35,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 03:10:35,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:10:35" (1/1) ... [2023-02-17 03:10:35,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2fba0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:35, skipping insertion in model container [2023-02-17 03:10:35,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:10:35" (1/1) ... [2023-02-17 03:10:35,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 03:10:35,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:10:36,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:10:36,041 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-17 03:10:36,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:10:36,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:10:36,128 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 03:10:36,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:10:36,246 INFO L208 MainTranslator]: Completed translation [2023-02-17 03:10:36,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36 WrapperNode [2023-02-17 03:10:36,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 03:10:36,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 03:10:36,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 03:10:36,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 03:10:36,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36" (1/1) ... [2023-02-17 03:10:36,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36" (1/1) ... [2023-02-17 03:10:36,314 INFO L138 Inliner]: procedures = 169, calls = 80, calls flagged for inlining = 25, calls inlined = 7, statements flattened = 65 [2023-02-17 03:10:36,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 03:10:36,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 03:10:36,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 03:10:36,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 03:10:36,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36" (1/1) ... [2023-02-17 03:10:36,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36" (1/1) ... [2023-02-17 03:10:36,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36" (1/1) ... [2023-02-17 03:10:36,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36" (1/1) ... [2023-02-17 03:10:36,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36" (1/1) ... [2023-02-17 03:10:36,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36" (1/1) ... [2023-02-17 03:10:36,363 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36" (1/1) ... [2023-02-17 03:10:36,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36" (1/1) ... [2023-02-17 03:10:36,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 03:10:36,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 03:10:36,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 03:10:36,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 03:10:36,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36" (1/1) ... [2023-02-17 03:10:36,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:10:36,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:10:36,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 03:10:36,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 03:10:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-17 03:10:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-17 03:10:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 03:10:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 03:10:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 03:10:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 03:10:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 03:10:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 03:10:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 03:10:36,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 03:10:36,616 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 03:10:36,618 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 03:10:36,840 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 03:10:36,845 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 03:10:36,846 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 03:10:36,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:10:36 BoogieIcfgContainer [2023-02-17 03:10:36,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 03:10:36,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 03:10:36,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 03:10:36,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 03:10:36,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 03:10:35" (1/3) ... [2023-02-17 03:10:36,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197b5206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:10:36, skipping insertion in model container [2023-02-17 03:10:36,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:10:36" (2/3) ... [2023-02-17 03:10:36,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197b5206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:10:36, skipping insertion in model container [2023-02-17 03:10:36,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:10:36" (3/3) ... [2023-02-17 03:10:36,858 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2.i [2023-02-17 03:10:36,872 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 03:10:36,872 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-17 03:10:36,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 03:10:36,925 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;@6896f240, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 03:10:36,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-17 03:10:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 45 states have internal predecessors, (50), 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-17 03:10:36,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 03:10:36,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:36,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:36,938 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:36,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:36,946 INFO L85 PathProgramCache]: Analyzing trace with hash 566157246, now seen corresponding path program 1 times [2023-02-17 03:10:36,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:36,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96364496] [2023-02-17 03:10:36,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:36,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:36,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:36,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:36,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 03:10:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:37,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:10:37,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:37,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:37,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:37,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96364496] [2023-02-17 03:10:37,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96364496] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:37,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:37,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:10:37,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344065338] [2023-02-17 03:10:37,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:37,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:10:37,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:37,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:10:37,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:10:37,243 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 45 states have internal predecessors, (50), 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) 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-17 03:10:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:37,358 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2023-02-17 03:10:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:10:37,365 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-17 03:10:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:37,371 INFO L225 Difference]: With dead ends: 89 [2023-02-17 03:10:37,374 INFO L226 Difference]: Without dead ends: 85 [2023-02-17 03:10:37,375 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-17 03:10:37,379 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:37,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 218 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:10:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-17 03:10:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2023-02-17 03:10:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 46 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:10:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-17 03:10:37,411 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 12 [2023-02-17 03:10:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:37,411 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-17 03:10:37,412 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-17 03:10:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-17 03:10:37,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 03:10:37,413 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:37,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:37,429 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-17 03:10:37,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:37,623 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash 566187056, now seen corresponding path program 1 times [2023-02-17 03:10:37,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:37,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165926795] [2023-02-17 03:10:37,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:37,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:37,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:37,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:37,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 03:10:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:37,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:10:37,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:37,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:37,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:37,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165926795] [2023-02-17 03:10:37,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165926795] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:37,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:37,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:10:37,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005655460] [2023-02-17 03:10:37,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:37,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:10:37,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:37,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:10:37,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:10:37,761 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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-17 03:10:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:37,806 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2023-02-17 03:10:37,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:10:37,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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-17 03:10:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:37,808 INFO L225 Difference]: With dead ends: 48 [2023-02-17 03:10:37,808 INFO L226 Difference]: Without dead ends: 48 [2023-02-17 03:10:37,808 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-17 03:10:37,810 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:37,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 127 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:10:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-17 03:10:37,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-02-17 03:10:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 44 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:10:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-02-17 03:10:37,817 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2023-02-17 03:10:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:37,817 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-02-17 03:10:37,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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-17 03:10:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-02-17 03:10:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 03:10:37,819 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:37,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:37,831 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-17 03:10:38,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:38,025 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:38,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1985999715, now seen corresponding path program 1 times [2023-02-17 03:10:38,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:38,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754967667] [2023-02-17 03:10:38,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:38,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:38,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:38,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:38,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 03:10:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:38,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:10:38,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:38,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-17 03:10:38,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:38,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:38,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754967667] [2023-02-17 03:10:38,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754967667] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:38,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:38,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:10:38,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004978357] [2023-02-17 03:10:38,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:38,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:10:38,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:38,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:10:38,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:10:38,154 INFO L87 Difference]: Start difference. First operand 48 states and 52 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-17 03:10:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:38,193 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2023-02-17 03:10:38,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:10:38,194 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-17 03:10:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:38,196 INFO L225 Difference]: With dead ends: 56 [2023-02-17 03:10:38,196 INFO L226 Difference]: Without dead ends: 56 [2023-02-17 03:10:38,196 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-17 03:10:38,199 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 22 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:38,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 167 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:10:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-17 03:10:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2023-02-17 03:10:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:10:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-17 03:10:38,211 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 12 [2023-02-17 03:10:38,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:38,211 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-17 03:10:38,211 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-17 03:10:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-17 03:10:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 03:10:38,212 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:38,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:38,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:38,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:38,414 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1985999298, now seen corresponding path program 1 times [2023-02-17 03:10:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:38,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567974856] [2023-02-17 03:10:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:38,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:38,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:38,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:38,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 03:10:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:38,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 03:10:38,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:38,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:38,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:38,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567974856] [2023-02-17 03:10:38,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567974856] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:38,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:38,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:10:38,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231864000] [2023-02-17 03:10:38,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:38,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:10:38,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:38,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:10:38,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:10:38,486 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-17 03:10:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:38,582 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2023-02-17 03:10:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:10:38,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-17 03:10:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:38,584 INFO L225 Difference]: With dead ends: 55 [2023-02-17 03:10:38,585 INFO L226 Difference]: Without dead ends: 55 [2023-02-17 03:10:38,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:10:38,586 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:38,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 73 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:10:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-17 03:10:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2023-02-17 03:10:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 47 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:10:38,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-02-17 03:10:38,599 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 12 [2023-02-17 03:10:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:38,599 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-02-17 03:10:38,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-17 03:10:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-02-17 03:10:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 03:10:38,600 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:38,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:38,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:38,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:38,812 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:38,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:38,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1985999297, now seen corresponding path program 1 times [2023-02-17 03:10:38,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:38,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887356106] [2023-02-17 03:10:38,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:38,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:38,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:38,815 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:38,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 03:10:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:38,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 03:10:38,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:38,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:38,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:38,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887356106] [2023-02-17 03:10:38,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887356106] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:38,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:38,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:10:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589995882] [2023-02-17 03:10:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:38,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:10:38,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:38,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:10:38,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:10:38,882 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-17 03:10:38,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:38,951 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2023-02-17 03:10:38,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:10:38,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-17 03:10:38,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:38,953 INFO L225 Difference]: With dead ends: 85 [2023-02-17 03:10:38,953 INFO L226 Difference]: Without dead ends: 85 [2023-02-17 03:10:38,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:10:38,954 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 39 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:38,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 165 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:10:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-17 03:10:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2023-02-17 03:10:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 66 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:10:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2023-02-17 03:10:38,960 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 12 [2023-02-17 03:10:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:38,961 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2023-02-17 03:10:38,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-17 03:10:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2023-02-17 03:10:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 03:10:38,962 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:38,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:38,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:39,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:39,176 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:39,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash 371929625, now seen corresponding path program 1 times [2023-02-17 03:10:39,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:39,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89531219] [2023-02-17 03:10:39,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:39,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:39,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:39,179 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:39,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-17 03:10:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:39,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 03:10:39,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:39,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:39,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:39,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89531219] [2023-02-17 03:10:39,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89531219] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:39,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:39,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:10:39,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678950140] [2023-02-17 03:10:39,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:39,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:10:39,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:39,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:10:39,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:10:39,254 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 6 states, 5 states have (on average 2.2) 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-17 03:10:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:39,343 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-02-17 03:10:39,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:10:39,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) 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-17 03:10:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:39,344 INFO L225 Difference]: With dead ends: 83 [2023-02-17 03:10:39,344 INFO L226 Difference]: Without dead ends: 83 [2023-02-17 03:10:39,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:10:39,345 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 74 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:39,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 137 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:10:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-17 03:10:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2023-02-17 03:10:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 66 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:10:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2023-02-17 03:10:39,351 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 13 [2023-02-17 03:10:39,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:39,351 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2023-02-17 03:10:39,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) 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-17 03:10:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2023-02-17 03:10:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 03:10:39,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:39,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:39,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:39,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:39,561 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:39,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:39,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1435524838, now seen corresponding path program 1 times [2023-02-17 03:10:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:39,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108690027] [2023-02-17 03:10:39,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:39,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:39,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:39,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:39,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-17 03:10:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:39,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 03:10:39,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:39,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:39,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:39,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108690027] [2023-02-17 03:10:39,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108690027] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:39,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:39,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:10:39,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104952889] [2023-02-17 03:10:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:39,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:10:39,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:39,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:10:39,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:10:39,660 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 5 states, 5 states have (on average 2.2) 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-17 03:10:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:39,692 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2023-02-17 03:10:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:10:39,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-17 03:10:39,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:39,693 INFO L225 Difference]: With dead ends: 52 [2023-02-17 03:10:39,693 INFO L226 Difference]: Without dead ends: 52 [2023-02-17 03:10:39,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-17 03:10:39,694 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:39,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 169 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:10:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-17 03:10:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2023-02-17 03:10:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 45 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:10:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-02-17 03:10:39,699 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 13 [2023-02-17 03:10:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:39,699 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-02-17 03:10:39,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-17 03:10:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-02-17 03:10:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 03:10:39,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:39,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:39,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:39,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:39,911 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:39,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1355083438, now seen corresponding path program 1 times [2023-02-17 03:10:39,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:39,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263687740] [2023-02-17 03:10:39,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:39,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:39,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:39,913 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:39,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-17 03:10:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:39,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 03:10:39,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:39,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 03:10:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:40,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:40,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263687740] [2023-02-17 03:10:40,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263687740] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:40,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:40,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:10:40,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687758854] [2023-02-17 03:10:40,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:40,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:10:40,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:40,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:10:40,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:10:40,003 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 03:10:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:40,062 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2023-02-17 03:10:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:10:40,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2023-02-17 03:10:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:40,063 INFO L225 Difference]: With dead ends: 47 [2023-02-17 03:10:40,063 INFO L226 Difference]: Without dead ends: 47 [2023-02-17 03:10:40,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-17 03:10:40,064 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:40,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:10:40,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-17 03:10:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-02-17 03:10:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:10:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2023-02-17 03:10:40,068 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 14 [2023-02-17 03:10:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:40,069 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2023-02-17 03:10:40,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 03:10:40,069 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2023-02-17 03:10:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 03:10:40,070 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:40,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:40,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:40,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:40,280 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1355040639, now seen corresponding path program 1 times [2023-02-17 03:10:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:40,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715250277] [2023-02-17 03:10:40,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:40,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:40,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:40,282 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:40,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 03:10:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:40,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 03:10:40,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:40,363 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_12 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_12) |c_#length|)))) is different from true [2023-02-17 03:10:40,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:10:40,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 03:10:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:40,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:40,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:40,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715250277] [2023-02-17 03:10:40,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715250277] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:40,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:40,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:10:40,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136730608] [2023-02-17 03:10:40,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:40,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 03:10:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:40,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 03:10:40,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2023-02-17 03:10:40,395 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-17 03:10:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:40,494 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2023-02-17 03:10:40,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:10:40,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2023-02-17 03:10:40,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:40,495 INFO L225 Difference]: With dead ends: 48 [2023-02-17 03:10:40,495 INFO L226 Difference]: Without dead ends: 48 [2023-02-17 03:10:40,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2023-02-17 03:10:40,496 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 65 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:40,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 80 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2023-02-17 03:10:40,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-17 03:10:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2023-02-17 03:10:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:10:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-02-17 03:10:40,498 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2023-02-17 03:10:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:40,499 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-02-17 03:10:40,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-17 03:10:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-02-17 03:10:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 03:10:40,499 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:40,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:40,511 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-17 03:10:40,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:40,706 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:40,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1579844705, now seen corresponding path program 1 times [2023-02-17 03:10:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:40,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547868766] [2023-02-17 03:10:40,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:40,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:40,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:40,708 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:40,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-17 03:10:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:40,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:10:40,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:40,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:40,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:40,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547868766] [2023-02-17 03:10:40,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547868766] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:40,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:40,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:10:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514842522] [2023-02-17 03:10:40,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:40,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:10:40,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:40,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:10:40,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:10:40,769 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:10:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:40,816 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2023-02-17 03:10:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:10:40,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-17 03:10:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:40,817 INFO L225 Difference]: With dead ends: 47 [2023-02-17 03:10:40,817 INFO L226 Difference]: Without dead ends: 38 [2023-02-17 03:10:40,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-17 03:10:40,818 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:40,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:10:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-17 03:10:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-17 03:10:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 35 states have internal predecessors, (38), 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-17 03:10:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2023-02-17 03:10:40,820 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 14 [2023-02-17 03:10:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:40,821 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2023-02-17 03:10:40,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:10:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2023-02-17 03:10:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 03:10:40,821 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:40,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:40,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:41,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:41,031 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:41,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:41,032 INFO L85 PathProgramCache]: Analyzing trace with hash -893009794, now seen corresponding path program 1 times [2023-02-17 03:10:41,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:41,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552399400] [2023-02-17 03:10:41,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:41,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:41,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:41,033 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:41,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-17 03:10:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:41,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:10:41,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:41,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:41,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:41,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552399400] [2023-02-17 03:10:41,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552399400] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:41,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:41,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:10:41,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692564177] [2023-02-17 03:10:41,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:41,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:10:41,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:41,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:10:41,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:10:41,095 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-17 03:10:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:41,116 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2023-02-17 03:10:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:10:41,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2023-02-17 03:10:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:41,130 INFO L225 Difference]: With dead ends: 46 [2023-02-17 03:10:41,130 INFO L226 Difference]: Without dead ends: 46 [2023-02-17 03:10:41,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-17 03:10:41,131 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:41,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 138 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:10:41,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-17 03:10:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2023-02-17 03:10:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 37 states have internal predecessors, (40), 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-17 03:10:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2023-02-17 03:10:41,134 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2023-02-17 03:10:41,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:41,134 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2023-02-17 03:10:41,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-17 03:10:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2023-02-17 03:10:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 03:10:41,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:41,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:41,157 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 (12)] Ended with exit code 0 [2023-02-17 03:10:41,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:41,336 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:41,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash -893009377, now seen corresponding path program 1 times [2023-02-17 03:10:41,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:41,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653031851] [2023-02-17 03:10:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:41,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:41,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:41,338 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:41,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-17 03:10:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:41,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 03:10:41,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:41,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:10:41,411 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 17 treesize of output 39 [2023-02-17 03:10:41,456 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 0 case distinctions, treesize of input 28 treesize of output 26 [2023-02-17 03:10:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:41,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:41,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:41,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653031851] [2023-02-17 03:10:41,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653031851] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:41,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:41,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:10:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077228425] [2023-02-17 03:10:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:41,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 03:10:41,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 03:10:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:10:41,466 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-17 03:10:41,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:41,586 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2023-02-17 03:10:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:10:41,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2023-02-17 03:10:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:41,587 INFO L225 Difference]: With dead ends: 45 [2023-02-17 03:10:41,587 INFO L226 Difference]: Without dead ends: 45 [2023-02-17 03:10:41,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:10:41,588 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:41,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 81 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:10:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-17 03:10:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2023-02-17 03:10:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 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-17 03:10:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-02-17 03:10:41,590 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 17 [2023-02-17 03:10:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:41,591 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-02-17 03:10:41,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-17 03:10:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-02-17 03:10:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 03:10:41,591 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:41,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:41,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:41,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:41,798 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:41,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:41,799 INFO L85 PathProgramCache]: Analyzing trace with hash -893009376, now seen corresponding path program 1 times [2023-02-17 03:10:41,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:41,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117962446] [2023-02-17 03:10:41,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:41,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:41,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:41,800 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:41,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-17 03:10:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:41,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 03:10:41,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:43,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:10:43,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 03:10:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:43,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:43,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:43,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117962446] [2023-02-17 03:10:43,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117962446] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:43,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:43,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:10:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346585673] [2023-02-17 03:10:43,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:43,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:10:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:10:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=18, Unknown=2, NotChecked=0, Total=30 [2023-02-17 03:10:43,916 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-17 03:10:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:44,017 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2023-02-17 03:10:44,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:10:44,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2023-02-17 03:10:44,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:44,018 INFO L225 Difference]: With dead ends: 40 [2023-02-17 03:10:44,018 INFO L226 Difference]: Without dead ends: 40 [2023-02-17 03:10:44,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=20, Invalid=34, Unknown=2, NotChecked=0, Total=56 [2023-02-17 03:10:44,019 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:44,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 69 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 19 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:10:44,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-17 03:10:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-02-17 03:10:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 37 states have internal predecessors, (40), 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-17 03:10:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2023-02-17 03:10:44,026 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2023-02-17 03:10:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:44,028 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2023-02-17 03:10:44,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-17 03:10:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2023-02-17 03:10:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 03:10:44,029 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:44,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:44,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:44,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:44,237 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:44,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:44,237 INFO L85 PathProgramCache]: Analyzing trace with hash 811449152, now seen corresponding path program 1 times [2023-02-17 03:10:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:44,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578022711] [2023-02-17 03:10:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:44,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:44,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:44,239 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:44,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-17 03:10:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:44,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 03:10:44,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:44,336 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_probe3_6_~p~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_probe3_6_~p~0#1.base| (_ bv0 1))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_probe3_6_~p~0#1.base|) (_ bv0 1)))) is different from true [2023-02-17 03:10:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:44,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:44,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:44,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578022711] [2023-02-17 03:10:44,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578022711] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:44,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:44,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 03:10:44,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841125776] [2023-02-17 03:10:44,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:44,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:10:44,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:44,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:10:44,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=32, Unknown=1, NotChecked=10, Total=56 [2023-02-17 03:10:44,345 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-17 03:10:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:44,488 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2023-02-17 03:10:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:10:44,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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 19 [2023-02-17 03:10:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:44,489 INFO L225 Difference]: With dead ends: 42 [2023-02-17 03:10:44,489 INFO L226 Difference]: Without dead ends: 34 [2023-02-17 03:10:44,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2023-02-17 03:10:44,490 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:44,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 99 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2023-02-17 03:10:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-17 03:10:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-17 03:10:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.24) internal successors, (31), 31 states have internal predecessors, (31), 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-17 03:10:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2023-02-17 03:10:44,493 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 19 [2023-02-17 03:10:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:44,493 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2023-02-17 03:10:44,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-17 03:10:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2023-02-17 03:10:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 03:10:44,494 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:44,494 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] [2023-02-17 03:10:44,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:44,703 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-17 03:10:44,703 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:44,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash 198913356, now seen corresponding path program 1 times [2023-02-17 03:10:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:44,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551204666] [2023-02-17 03:10:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:44,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:44,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:44,706 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-17 03:10:44,706 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-17 03:10:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:44,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 03:10:44,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:44,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:10:44,784 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 17 treesize of output 39 [2023-02-17 03:10:44,816 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 0 case distinctions, treesize of input 28 treesize of output 26 [2023-02-17 03:10:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:44,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:44,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:44,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551204666] [2023-02-17 03:10:44,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551204666] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:44,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:44,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:10:44,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618204236] [2023-02-17 03:10:44,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:44,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:10:44,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:44,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:10:44,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:10:44,834 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-17 03:10:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:44,978 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2023-02-17 03:10:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:10:44,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 20 [2023-02-17 03:10:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:44,979 INFO L225 Difference]: With dead ends: 33 [2023-02-17 03:10:44,979 INFO L226 Difference]: Without dead ends: 33 [2023-02-17 03:10:44,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-02-17 03:10:44,980 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:44,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 73 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:10:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-17 03:10:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-02-17 03:10:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 30 states have internal predecessors, (30), 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-17 03:10:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2023-02-17 03:10:44,982 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 20 [2023-02-17 03:10:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:44,982 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2023-02-17 03:10:44,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-17 03:10:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2023-02-17 03:10:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 03:10:44,983 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:44,983 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] [2023-02-17 03:10:44,996 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-17 03:10:45,183 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-17 03:10:45,184 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:45,184 INFO L85 PathProgramCache]: Analyzing trace with hash 198913357, now seen corresponding path program 1 times [2023-02-17 03:10:45,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:45,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677079168] [2023-02-17 03:10:45,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:45,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:45,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:45,186 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:45,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-17 03:10:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:45,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 03:10:45,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:45,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:45,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:45,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677079168] [2023-02-17 03:10:45,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677079168] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:45,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:45,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:10:45,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432002354] [2023-02-17 03:10:45,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:45,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:10:45,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:45,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:10:45,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:10:45,278 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-17 03:10:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:45,322 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2023-02-17 03:10:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:10:45,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 20 [2023-02-17 03:10:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:45,323 INFO L225 Difference]: With dead ends: 32 [2023-02-17 03:10:45,323 INFO L226 Difference]: Without dead ends: 32 [2023-02-17 03:10:45,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:10:45,324 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 59 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:45,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 44 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:10:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-17 03:10:45,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-17 03:10:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 29 states have internal predecessors, (29), 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-17 03:10:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 31 transitions. [2023-02-17 03:10:45,326 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 31 transitions. Word has length 20 [2023-02-17 03:10:45,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:45,326 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 31 transitions. [2023-02-17 03:10:45,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-17 03:10:45,326 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2023-02-17 03:10:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 03:10:45,327 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:45,327 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] [2023-02-17 03:10:45,338 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-17 03:10:45,527 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-17 03:10:45,527 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:45,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1871346763, now seen corresponding path program 1 times [2023-02-17 03:10:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:45,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549263700] [2023-02-17 03:10:45,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:45,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:45,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:45,530 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-17 03:10:45,533 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-17 03:10:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:45,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 03:10:45,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:45,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:10:45,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 03:10:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:45,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:45,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:45,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549263700] [2023-02-17 03:10:45,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549263700] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:45,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:45,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 03:10:45,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677313795] [2023-02-17 03:10:45,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:45,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 03:10:45,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:45,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 03:10:45,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:10:45,644 INFO L87 Difference]: Start difference. First operand 32 states and 31 transitions. Second operand has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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-17 03:10:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:45,745 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2023-02-17 03:10:45,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 03:10:45,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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 21 [2023-02-17 03:10:45,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:45,746 INFO L225 Difference]: With dead ends: 31 [2023-02-17 03:10:45,746 INFO L226 Difference]: Without dead ends: 31 [2023-02-17 03:10:45,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-02-17 03:10:45,747 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:45,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 81 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:10:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-17 03:10:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-17 03:10:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 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-17 03:10:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2023-02-17 03:10:45,749 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 21 [2023-02-17 03:10:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:45,749 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2023-02-17 03:10:45,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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-17 03:10:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2023-02-17 03:10:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 03:10:45,749 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:45,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:45,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:45,956 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-17 03:10:45,957 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:45,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:45,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2117792404, now seen corresponding path program 1 times [2023-02-17 03:10:45,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:45,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033224639] [2023-02-17 03:10:45,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:45,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:45,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:45,958 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:45,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-17 03:10:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:46,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 03:10:46,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:46,059 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-17 03:10:46,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-17 03:10:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:10:46,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:46,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:46,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033224639] [2023-02-17 03:10:46,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033224639] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:46,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:46,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 03:10:46,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002903010] [2023-02-17 03:10:46,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:46,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 03:10:46,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:46,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 03:10:46,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-02-17 03:10:46,134 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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-17 03:10:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:46,298 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2023-02-17 03:10:46,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 03:10:46,299 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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 22 [2023-02-17 03:10:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:46,299 INFO L225 Difference]: With dead ends: 30 [2023-02-17 03:10:46,300 INFO L226 Difference]: Without dead ends: 30 [2023-02-17 03:10:46,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-02-17 03:10:46,301 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:46,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 78 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:10:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-17 03:10:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-17 03:10:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 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-17 03:10:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 29 transitions. [2023-02-17 03:10:46,302 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 29 transitions. Word has length 22 [2023-02-17 03:10:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:46,303 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 29 transitions. [2023-02-17 03:10:46,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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-17 03:10:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2023-02-17 03:10:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 03:10:46,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:46,303 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] [2023-02-17 03:10:46,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:46,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:46,510 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-17 03:10:46,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:46,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1227054995, now seen corresponding path program 1 times [2023-02-17 03:10:46,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:46,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248854677] [2023-02-17 03:10:46,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:46,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:46,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:46,513 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:10:46,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-17 03:10:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 03:10:46,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 03:10:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 03:10:46,682 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-17 03:10:46,682 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 03:10:46,683 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (15 of 16 remaining) [2023-02-17 03:10:46,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2023-02-17 03:10:46,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-02-17 03:10:46,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (12 of 16 remaining) [2023-02-17 03:10:46,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (11 of 16 remaining) [2023-02-17 03:10:46,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (10 of 16 remaining) [2023-02-17 03:10:46,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (9 of 16 remaining) [2023-02-17 03:10:46,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (8 of 16 remaining) [2023-02-17 03:10:46,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (7 of 16 remaining) [2023-02-17 03:10:46,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-02-17 03:10:46,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2023-02-17 03:10:46,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (4 of 16 remaining) [2023-02-17 03:10:46,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (3 of 16 remaining) [2023-02-17 03:10:46,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2023-02-17 03:10:46,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2023-02-17 03:10:46,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-02-17 03:10:46,744 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 (20)] Ended with exit code 0 [2023-02-17 03:10:46,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:10:46,925 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:10:46,931 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 03:10:46,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 03:10:46 BoogieIcfgContainer [2023-02-17 03:10:46,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 03:10:46,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 03:10:46,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 03:10:46,972 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 03:10:46,973 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:10:36" (3/4) ... [2023-02-17 03:10:46,974 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 03:10:47,022 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 03:10:47,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 03:10:47,023 INFO L158 Benchmark]: Toolchain (without parser) took 11406.24ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 77.7MB in the beginning and 85.2MB in the end (delta: -7.5MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2023-02-17 03:10:47,023 INFO L158 Benchmark]: CDTParser took 1.40ms. Allocated memory is still 67.1MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 03:10:47,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 629.06ms. Allocated memory is still 98.6MB. Free memory was 77.4MB in the beginning and 73.1MB in the end (delta: 4.3MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2023-02-17 03:10:47,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.42ms. Allocated memory is still 98.6MB. Free memory was 73.1MB in the beginning and 71.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 03:10:47,024 INFO L158 Benchmark]: Boogie Preprocessor took 54.93ms. Allocated memory is still 98.6MB. Free memory was 71.0MB in the beginning and 68.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 03:10:47,028 INFO L158 Benchmark]: RCFGBuilder took 478.95ms. Allocated memory is still 98.6MB. Free memory was 68.9MB in the beginning and 54.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 03:10:47,029 INFO L158 Benchmark]: TraceAbstraction took 10119.10ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 54.2MB in the beginning and 88.3MB in the end (delta: -34.1MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2023-02-17 03:10:47,029 INFO L158 Benchmark]: Witness Printer took 50.61ms. Allocated memory is still 119.5MB. Free memory was 88.3MB in the beginning and 85.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 03:10:47,031 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40ms. Allocated memory is still 67.1MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 629.06ms. Allocated memory is still 98.6MB. Free memory was 77.4MB in the beginning and 73.1MB in the end (delta: 4.3MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.42ms. Allocated memory is still 98.6MB. Free memory was 73.1MB in the beginning and 71.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.93ms. Allocated memory is still 98.6MB. Free memory was 71.0MB in the beginning and 68.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.95ms. Allocated memory is still 98.6MB. Free memory was 68.9MB in the beginning and 54.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10119.10ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 54.2MB in the beginning and 88.3MB in the end (delta: -34.1MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Witness Printer took 50.61ms. Allocated memory is still 119.5MB. Free memory was 88.3MB in the beginning and 85.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 782]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L784] struct A a6; VAL [a6={2:0}, ldv_global_msg_list={1:0}] [L793] CALL entry_point() [L786] CALL, EXPR probe3_6(&a6) [L764] int ret = - -3; VAL [a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, ret=3] [L765] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={2:0}, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L765] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(int))={6:0}, ret=3] [L765] int *p = (int *)ldv_malloc(sizeof(int)); [L766] COND FALSE !(p==0) [L768] CALL, EXPR f6() [L758] return __VERIFIER_nondet_int(); [L768] RET, EXPR f6() [L768] ret = f6() [L769] COND FALSE !(ret<0) [L771] CALL, EXPR g6() [L761] return __VERIFIER_nondet_int(); [L771] RET, EXPR g6() [L771] ret = g6() [L772] COND FALSE !(ret<0) VAL [a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, p={6:0}, ret=0] [L774] a->p = p VAL [a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, p={6:0}, ret=0] [L775] free(p) VAL [a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, p={6:0}, ret=0] [L775] free(p) VAL [a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, p={6:0}, ret=0] [L775] free(p) [L776] return 0; VAL [\result=0, a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, p={6:0}, ret=0] [L786] RET, EXPR probe3_6(&a6) [L786] int ret = probe3_6(&a6); [L787] COND TRUE ret==0 [L788] CALL disconnect_6(&a6) [L782] EXPR a->p VAL [a={2:0}, a={2:0}, a->p={6:0}, a6={2:0}, ldv_global_msg_list={1:0}] [L782] free(a->p) VAL [a={2:0}, a={2:0}, a->p={6:0}, a6={2:0}, ldv_global_msg_list={1:0}] [L782] free(a->p) VAL [a={2:0}, a={2:0}, a->p={6:0}, a6={2:0}, ldv_global_msg_list={1:0}] [L782] free(a->p) VAL [a={2:0}, a={2:0}, a->p={6:0}, a6={2:0}, ldv_global_msg_list={1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 644 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 644 mSDsluCounter, 1996 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 83 IncrementalHoareTripleChecker+Unchecked, 1354 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 891 IncrementalHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 642 mSDtfsCounter, 891 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=5, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 89 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 263 ConstructedInterpolants, 22 QuantifiedInterpolants, 2365 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1098 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-17 03:10:47,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)