./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-memsafety/list1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 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/pthread-memsafety/list1.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 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:34:23,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:34:23,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:34:23,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:34:23,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:34:23,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:34:23,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:34:23,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:34:23,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:34:23,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:34:23,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:34:23,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:34:23,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:34:23,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:34:23,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:34:23,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:34:23,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:34:23,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:34:23,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:34:23,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:34:23,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:34:23,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:34:23,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:34:23,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:34:23,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:34:23,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:34:23,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:34:23,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:34:23,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:34:23,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:34:23,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:34:23,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:34:23,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:34:23,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:34:23,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:34:23,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:34:23,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:34:23,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:34:23,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:34:23,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:34:23,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:34:23,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:34:23,891 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:34:23,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:34:23,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:34:23,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:34:23,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:34:23,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:34:23,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:34:23,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:34:23,893 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:34:23,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:34:23,893 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:34:23,893 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:34:23,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:34:23,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:34:23,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:34:23,894 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:34:23,894 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:34:23,894 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:34:23,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:34:23,894 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:34:23,894 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:34:23,894 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:34:23,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:34:23,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:34:23,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:34:23,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:34:23,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:34:23,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:34:23,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:34:23,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:34:23,895 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:34:23,895 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:34:23,895 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:34:23,896 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:34:23,896 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 -> 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 [2023-02-15 13:34:24,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:34:24,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:34:24,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:34:24,073 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:34:24,073 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:34:24,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/list1.i [2023-02-15 13:34:25,040 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:34:25,317 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:34:25,318 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2023-02-15 13:34:25,330 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51111b57e/a1d832b2f6c24d95b4871e015f3817f9/FLAGfd57c0afa [2023-02-15 13:34:25,346 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51111b57e/a1d832b2f6c24d95b4871e015f3817f9 [2023-02-15 13:34:25,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:34:25,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:34:25,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:34:25,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:34:25,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:34:25,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:25" (1/1) ... [2023-02-15 13:34:25,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c7ea7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:25, skipping insertion in model container [2023-02-15 13:34:25,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:25" (1/1) ... [2023-02-15 13:34:25,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:34:25,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:34:25,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:34:25,708 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-15 13:34:25,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1de437db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:25, skipping insertion in model container [2023-02-15 13:34:25,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:34:25,710 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 13:34:25,711 INFO L158 Benchmark]: Toolchain (without parser) took 361.48ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 128.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 13:34:25,712 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:34:25,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.07ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 128.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 13:34:25,714 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.14ms. Allocated memory is still 125.8MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.07ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 128.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1048]: 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/pthread-memsafety/list1.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 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:34:27,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:34:27,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:34:27,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:34:27,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:34:27,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:34:27,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:34:27,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:34:27,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:34:27,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:34:27,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:34:27,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:34:27,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:34:27,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:34:27,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:34:27,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:34:27,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:34:27,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:34:27,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:34:27,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:34:27,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:34:27,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:34:27,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:34:27,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:34:27,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:34:27,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:34:27,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:34:27,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:34:27,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:34:27,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:34:27,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:34:27,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:34:27,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:34:27,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:34:27,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:34:27,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:34:27,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:34:27,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:34:27,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:34:27,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:34:27,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:34:27,766 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 13:34:27,798 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:34:27,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:34:27,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:34:27,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:34:27,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:34:27,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:34:27,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:34:27,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:34:27,802 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:34:27,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:34:27,802 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:34:27,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:34:27,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:34:27,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:34:27,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:34:27,803 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:34:27,803 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:34:27,803 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:34:27,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:34:27,804 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:34:27,804 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 13:34:27,804 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 13:34:27,804 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:34:27,804 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:34:27,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:34:27,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:34:27,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:34:27,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:34:27,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:34:27,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:34:27,805 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 13:34:27,805 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 13:34:27,805 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:34:27,806 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:34:27,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:34:27,806 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 13:34:27,806 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:34:27,806 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 -> 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 [2023-02-15 13:34:28,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:34:28,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:34:28,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:34:28,098 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:34:28,099 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:34:28,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/list1.i [2023-02-15 13:34:29,127 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:34:29,346 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:34:29,346 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2023-02-15 13:34:29,354 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658e11ae1/ca7c98aca82c4cc5bd6c97011da26e70/FLAGfb840a56a [2023-02-15 13:34:29,365 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658e11ae1/ca7c98aca82c4cc5bd6c97011da26e70 [2023-02-15 13:34:29,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:34:29,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:34:29,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:34:29,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:34:29,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:34:29,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:29,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cfb6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29, skipping insertion in model container [2023-02-15 13:34:29,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:29,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:34:29,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:34:29,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:34:29,740 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 13:34:29,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:34:29,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:34:29,778 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:34:29,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:34:29,898 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:34:29,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29 WrapperNode [2023-02-15 13:34:29,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:34:29,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:34:29,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:34:29,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:34:29,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:29,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:29,993 INFO L138 Inliner]: procedures = 267, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-02-15 13:34:29,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:34:29,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:34:29,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:34:29,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:34:30,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:30,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:30,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:30,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:30,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:30,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:30,036 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:30,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:30,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:34:30,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:34:30,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:34:30,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:34:30,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29" (1/1) ... [2023-02-15 13:34:30,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:34:30,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:30,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 13:34:30,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 13:34:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 13:34:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 13:34:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:34:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 13:34:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:34:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 13:34:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:34:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:34:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2023-02-15 13:34:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2023-02-15 13:34:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure build [2023-02-15 13:34:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2023-02-15 13:34:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:34:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:34:30,101 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-02-15 13:34:30,290 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:34:30,291 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:34:30,646 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:34:30,661 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:34:30,661 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 13:34:30,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:34:30 BoogieIcfgContainer [2023-02-15 13:34:30,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:34:30,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:34:30,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:34:30,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:34:30,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:34:29" (1/3) ... [2023-02-15 13:34:30,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11439c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:34:30, skipping insertion in model container [2023-02-15 13:34:30,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:29" (2/3) ... [2023-02-15 13:34:30,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11439c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:34:30, skipping insertion in model container [2023-02-15 13:34:30,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:34:30" (3/3) ... [2023-02-15 13:34:30,669 INFO L112 eAbstractionObserver]: Analyzing ICFG list1.i [2023-02-15 13:34:30,681 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:34:30,682 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-02-15 13:34:30,682 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-02-15 13:34:30,779 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-02-15 13:34:30,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 151 transitions, 318 flow [2023-02-15 13:34:30,839 INFO L130 PetriNetUnfolder]: 6/149 cut-off events. [2023-02-15 13:34:30,839 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-02-15 13:34:30,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 149 events. 6/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 373 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 87. Up to 3 conditions per place. [2023-02-15 13:34:30,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 151 transitions, 318 flow [2023-02-15 13:34:30,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 144 transitions, 300 flow [2023-02-15 13:34:30,849 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-02-15 13:34:30,855 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 144 transitions, 300 flow [2023-02-15 13:34:30,857 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 144 transitions, 300 flow [2023-02-15 13:34:30,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 300 flow [2023-02-15 13:34:30,876 INFO L130 PetriNetUnfolder]: 6/144 cut-off events. [2023-02-15 13:34:30,877 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-02-15 13:34:30,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 144 events. 6/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 374 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 87. Up to 3 conditions per place. [2023-02-15 13:34:30,878 INFO L119 LiptonReduction]: Number of co-enabled transitions 960 [2023-02-15 13:34:50,017 INFO L134 LiptonReduction]: Checked pairs total: 1645 [2023-02-15 13:34:50,017 INFO L136 LiptonReduction]: Total number of compositions: 182 [2023-02-15 13:34:50,028 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:34:50,032 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;@455cd407, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:34:50,032 INFO L358 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2023-02-15 13:34:50,034 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-02-15 13:34:50,034 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-02-15 13:34:50,034 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:34:50,034 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2023-02-15 13:34:50,035 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:34:50,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:50,038 INFO L85 PathProgramCache]: Analyzing trace with hash 637, now seen corresponding path program 1 times [2023-02-15 13:34:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:50,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456651938] [2023-02-15 13:34:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:50,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:50,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:50,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:50,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 13:34:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:50,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 13:34:50,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:50,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:50,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:50,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456651938] [2023-02-15 13:34:50,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456651938] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:50,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:50,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-02-15 13:34:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783303046] [2023-02-15 13:34:50,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:50,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 13:34:50,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:50,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 13:34:50,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 13:34:50,128 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 333 [2023-02-15 13:34:50,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:50,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:34:50,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 333 [2023-02-15 13:34:50,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:34:50,317 INFO L130 PetriNetUnfolder]: 100/235 cut-off events. [2023-02-15 13:34:50,324 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-02-15 13:34:50,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 235 events. 100/235 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 968 event pairs, 84 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 261. Up to 228 conditions per place. [2023-02-15 13:34:50,328 INFO L137 encePairwiseOnDemand]: 322/333 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-02-15 13:34:50,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 49 transitions, 204 flow [2023-02-15 13:34:50,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 13:34:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-02-15 13:34:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 348 transitions. [2023-02-15 13:34:50,339 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5225225225225225 [2023-02-15 13:34:50,340 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 348 transitions. [2023-02-15 13:34:50,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 348 transitions. [2023-02-15 13:34:50,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:34:50,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 348 transitions. [2023-02-15 13:34:50,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 174.0) internal successors, (348), 2 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:50,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:50,351 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:50,352 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 132 flow. Second operand 2 states and 348 transitions. [2023-02-15 13:34:50,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 49 transitions, 204 flow [2023-02-15 13:34:50,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-02-15 13:34:50,356 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 102 flow [2023-02-15 13:34:50,358 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2023-02-15 13:34:50,360 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -13 predicate places. [2023-02-15 13:34:50,360 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 102 flow [2023-02-15 13:34:50,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:50,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:34:50,361 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-02-15 13:34:50,372 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-15 13:34:50,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:50,568 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:34:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash 627788, now seen corresponding path program 1 times [2023-02-15 13:34:50,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:50,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488300026] [2023-02-15 13:34:50,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:50,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:50,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:50,571 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:50,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 13:34:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:50,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:34:50,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:50,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:50,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:50,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488300026] [2023-02-15 13:34:50,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488300026] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:50,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:50,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 13:34:50,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205818173] [2023-02-15 13:34:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:50,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:34:50,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:50,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:34:50,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:50,876 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 333 [2023-02-15 13:34:50,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:50,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:34:50,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 333 [2023-02-15 13:34:50,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:34:51,325 INFO L130 PetriNetUnfolder]: 157/376 cut-off events. [2023-02-15 13:34:51,326 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-02-15 13:34:51,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 376 events. 157/376 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 1954 event pairs, 107 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 747. Up to 215 conditions per place. [2023-02-15 13:34:51,331 INFO L137 encePairwiseOnDemand]: 324/333 looper letters, 82 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2023-02-15 13:34:51,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 92 transitions, 371 flow [2023-02-15 13:34:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:34:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 13:34:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-02-15 13:34:51,338 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4934934934934935 [2023-02-15 13:34:51,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-02-15 13:34:51,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-02-15 13:34:51,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:34:51,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-02-15 13:34:51,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:51,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:51,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:51,346 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 102 flow. Second operand 3 states and 493 transitions. [2023-02-15 13:34:51,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 92 transitions, 371 flow [2023-02-15 13:34:51,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 92 transitions, 371 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-02-15 13:34:51,348 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 160 flow [2023-02-15 13:34:51,348 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2023-02-15 13:34:51,349 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-02-15 13:34:51,349 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 160 flow [2023-02-15 13:34:51,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:51,350 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:34:51,350 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-02-15 13:34:51,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:51,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:51,558 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:34:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:51,563 INFO L85 PathProgramCache]: Analyzing trace with hash 627787, now seen corresponding path program 1 times [2023-02-15 13:34:51,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:51,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231029264] [2023-02-15 13:34:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:51,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:51,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:51,565 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:51,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 (4)] Waiting until timeout for monitored process [2023-02-15 13:34:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:51,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:34:51,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:51,710 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:34:51,711 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-15 13:34:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:51,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:51,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:51,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231029264] [2023-02-15 13:34:51,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231029264] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:51,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:51,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 13:34:51,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554907590] [2023-02-15 13:34:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:51,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:34:51,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:51,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:34:51,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:51,833 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 333 [2023-02-15 13:34:51,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 55 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:51,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:34:51,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 333 [2023-02-15 13:34:51,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:34:52,010 INFO L130 PetriNetUnfolder]: 181/437 cut-off events. [2023-02-15 13:34:52,011 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-02-15 13:34:52,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 437 events. 181/437 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2388 event pairs, 91 based on Foata normal form. 13/158 useless extension candidates. Maximal degree in co-relation 938. Up to 267 conditions per place. [2023-02-15 13:34:52,013 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 56 selfloop transitions, 8 changer transitions 0/66 dead transitions. [2023-02-15 13:34:52,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 317 flow [2023-02-15 13:34:52,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:34:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 13:34:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-02-15 13:34:52,015 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4574574574574575 [2023-02-15 13:34:52,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-02-15 13:34:52,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-02-15 13:34:52,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:34:52,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-02-15 13:34:52,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:52,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:52,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:52,018 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 160 flow. Second operand 3 states and 457 transitions. [2023-02-15 13:34:52,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 317 flow [2023-02-15 13:34:52,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-02-15 13:34:52,020 INFO L231 Difference]: Finished difference. Result has 53 places, 57 transitions, 182 flow [2023-02-15 13:34:52,021 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=53, PETRI_TRANSITIONS=57} [2023-02-15 13:34:52,021 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-02-15 13:34:52,021 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 182 flow [2023-02-15 13:34:52,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:52,022 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:34:52,022 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 13:34:52,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:52,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:52,248 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:34:52,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:52,249 INFO L85 PathProgramCache]: Analyzing trace with hash 603289611, now seen corresponding path program 1 times [2023-02-15 13:34:52,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:52,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729380737] [2023-02-15 13:34:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:52,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:52,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:52,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:52,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 13:34:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:52,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:34:52,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:52,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:34:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:52,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:52,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:52,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729380737] [2023-02-15 13:34:52,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729380737] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:52,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:52,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:34:52,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840929] [2023-02-15 13:34:52,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:52,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:34:52,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:34:52,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:52,472 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 333 [2023-02-15 13:34:52,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:52,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:34:52,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 333 [2023-02-15 13:34:52,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:34:52,654 INFO L130 PetriNetUnfolder]: 179/431 cut-off events. [2023-02-15 13:34:52,655 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-02-15 13:34:52,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 431 events. 179/431 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2350 event pairs, 90 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 994. Up to 258 conditions per place. [2023-02-15 13:34:52,657 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 54 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2023-02-15 13:34:52,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 317 flow [2023-02-15 13:34:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:34:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 13:34:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2023-02-15 13:34:52,659 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4754754754754755 [2023-02-15 13:34:52,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2023-02-15 13:34:52,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2023-02-15 13:34:52,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:34:52,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2023-02-15 13:34:52,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:52,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:52,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:52,662 INFO L175 Difference]: Start difference. First operand has 53 places, 57 transitions, 182 flow. Second operand 3 states and 475 transitions. [2023-02-15 13:34:52,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 317 flow [2023-02-15 13:34:52,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-02-15 13:34:52,665 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 182 flow [2023-02-15 13:34:52,665 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2023-02-15 13:34:52,665 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-02-15 13:34:52,665 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 182 flow [2023-02-15 13:34:52,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:52,666 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:34:52,666 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 13:34:52,691 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-15 13:34:52,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:52,874 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:34:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash 603289610, now seen corresponding path program 1 times [2023-02-15 13:34:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:52,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088541761] [2023-02-15 13:34:52,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:52,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:52,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:52,877 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:52,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 13:34:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:53,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 13:34:53,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:53,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:34:53,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:34:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:53,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:53,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:53,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088541761] [2023-02-15 13:34:53,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088541761] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:53,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:53,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:34:53,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404917055] [2023-02-15 13:34:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:53,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:34:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:53,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:34:53,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:53,235 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 333 [2023-02-15 13:34:53,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 55 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:53,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:34:53,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 333 [2023-02-15 13:34:53,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:34:53,427 INFO L130 PetriNetUnfolder]: 177/425 cut-off events. [2023-02-15 13:34:53,427 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2023-02-15 13:34:53,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 425 events. 177/425 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2319 event pairs, 95 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 978. Up to 266 conditions per place. [2023-02-15 13:34:53,429 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 53 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-02-15 13:34:53,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 313 flow [2023-02-15 13:34:53,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:34:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 13:34:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2023-02-15 13:34:53,431 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4744744744744745 [2023-02-15 13:34:53,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2023-02-15 13:34:53,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2023-02-15 13:34:53,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:34:53,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2023-02-15 13:34:53,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:53,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:53,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:53,435 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 182 flow. Second operand 3 states and 474 transitions. [2023-02-15 13:34:53,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 313 flow [2023-02-15 13:34:53,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-02-15 13:34:53,437 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 172 flow [2023-02-15 13:34:53,437 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2023-02-15 13:34:53,437 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -10 predicate places. [2023-02-15 13:34:53,438 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 172 flow [2023-02-15 13:34:53,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:53,438 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:34:53,438 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-02-15 13:34:53,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:53,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:53,647 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:34:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:53,647 INFO L85 PathProgramCache]: Analyzing trace with hash 19460939, now seen corresponding path program 1 times [2023-02-15 13:34:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:53,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630974025] [2023-02-15 13:34:53,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:53,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:53,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:53,649 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:53,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 13:34:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:53,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 13:34:53,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:53,753 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:34:53,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-15 13:34:53,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-02-15 13:34:53,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:34:53,803 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 19 treesize of output 19 [2023-02-15 13:34:53,816 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:34:53,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:34:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:53,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:53,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:53,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630974025] [2023-02-15 13:34:53,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630974025] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:53,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:53,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:34:53,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401765542] [2023-02-15 13:34:53,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:53,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:34:53,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:53,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:34:53,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:34:54,237 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 333 [2023-02-15 13:34:54,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:54,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:34:54,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 333 [2023-02-15 13:34:54,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:34:54,443 INFO L130 PetriNetUnfolder]: 166/402 cut-off events. [2023-02-15 13:34:54,443 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-02-15 13:34:54,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 402 events. 166/402 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 2261 event pairs, 86 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 915. Up to 248 conditions per place. [2023-02-15 13:34:54,445 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 50 selfloop transitions, 9 changer transitions 0/61 dead transitions. [2023-02-15 13:34:54,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 305 flow [2023-02-15 13:34:54,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:34:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-02-15 13:34:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2023-02-15 13:34:54,447 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4286786786786787 [2023-02-15 13:34:54,447 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2023-02-15 13:34:54,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2023-02-15 13:34:54,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:34:54,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2023-02-15 13:34:54,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:54,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:54,451 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:54,451 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 172 flow. Second operand 4 states and 571 transitions. [2023-02-15 13:34:54,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 305 flow [2023-02-15 13:34:54,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 61 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-02-15 13:34:54,453 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 172 flow [2023-02-15 13:34:54,453 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2023-02-15 13:34:54,454 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -10 predicate places. [2023-02-15 13:34:54,454 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 172 flow [2023-02-15 13:34:54,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:54,455 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:34:54,455 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 13:34:54,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:54,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:54,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:34:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:54,664 INFO L85 PathProgramCache]: Analyzing trace with hash 603291194, now seen corresponding path program 1 times [2023-02-15 13:34:54,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:54,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818959652] [2023-02-15 13:34:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:54,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:54,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:54,682 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:54,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 13:34:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:54,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 13:34:54,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:54,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:54,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:54,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818959652] [2023-02-15 13:34:54,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818959652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:54,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:54,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:34:54,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850838608] [2023-02-15 13:34:54,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:54,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:34:54,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:34:54,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:34:55,043 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 333 [2023-02-15 13:34:55,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 135.83333333333334) internal successors, (815), 6 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:55,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:34:55,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 333 [2023-02-15 13:34:55,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:34:55,403 INFO L130 PetriNetUnfolder]: 179/444 cut-off events. [2023-02-15 13:34:55,403 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-02-15 13:34:55,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 444 events. 179/444 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 2463 event pairs, 138 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 1005. Up to 392 conditions per place. [2023-02-15 13:34:55,406 INFO L137 encePairwiseOnDemand]: 322/333 looper letters, 54 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2023-02-15 13:34:55,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 342 flow [2023-02-15 13:34:55,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:34:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-02-15 13:34:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1003 transitions. [2023-02-15 13:34:55,409 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4302874302874303 [2023-02-15 13:34:55,421 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1003 transitions. [2023-02-15 13:34:55,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1003 transitions. [2023-02-15 13:34:55,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:34:55,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1003 transitions. [2023-02-15 13:34:55,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.28571428571428) internal successors, (1003), 7 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:55,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 333.0) internal successors, (2664), 8 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:55,439 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 333.0) internal successors, (2664), 8 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:55,439 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 172 flow. Second operand 7 states and 1003 transitions. [2023-02-15 13:34:55,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 342 flow [2023-02-15 13:34:55,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-02-15 13:34:55,442 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 229 flow [2023-02-15 13:34:55,443 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2023-02-15 13:34:55,443 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-02-15 13:34:55,443 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 229 flow [2023-02-15 13:34:55,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.83333333333334) internal successors, (815), 6 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:55,444 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:34:55,444 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:55,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:55,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:55,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:34:55,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:55,653 INFO L85 PathProgramCache]: Analyzing trace with hash -57764152, now seen corresponding path program 1 times [2023-02-15 13:34:55,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:55,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696541381] [2023-02-15 13:34:55,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:55,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:55,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:55,654 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:55,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 13:34:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:55,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 13:34:55,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:55,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:34:55,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:34:55,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:34:55,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:34:55,834 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:34:55,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:34:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:55,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:55,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:55,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696541381] [2023-02-15 13:34:55,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696541381] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:55,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:55,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:34:55,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146532934] [2023-02-15 13:34:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:55,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:34:55,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:55,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:34:55,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:34:56,008 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 333 [2023-02-15 13:34:56,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:56,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:34:56,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 333 [2023-02-15 13:34:56,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:34:56,175 INFO L130 PetriNetUnfolder]: 179/430 cut-off events. [2023-02-15 13:34:56,175 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2023-02-15 13:34:56,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 430 events. 179/430 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 2318 event pairs, 84 based on Foata normal form. 9/189 useless extension candidates. Maximal degree in co-relation 1055. Up to 262 conditions per place. [2023-02-15 13:34:56,177 INFO L137 encePairwiseOnDemand]: 324/333 looper letters, 58 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2023-02-15 13:34:56,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 382 flow [2023-02-15 13:34:56,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:34:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-02-15 13:34:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-02-15 13:34:56,179 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41291291291291293 [2023-02-15 13:34:56,179 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-02-15 13:34:56,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-02-15 13:34:56,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:34:56,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-02-15 13:34:56,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:56,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:56,182 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:56,182 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 229 flow. Second operand 4 states and 550 transitions. [2023-02-15 13:34:56,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 382 flow [2023-02-15 13:34:56,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-02-15 13:34:56,183 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 240 flow [2023-02-15 13:34:56,184 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2023-02-15 13:34:56,184 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2023-02-15 13:34:56,184 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 240 flow [2023-02-15 13:34:56,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:56,185 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:34:56,185 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:56,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:56,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:56,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:34:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash -57763943, now seen corresponding path program 1 times [2023-02-15 13:34:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:56,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439033588] [2023-02-15 13:34:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:56,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:56,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:56,396 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:56,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 13:34:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:56,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:34:56,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:56,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:34:56,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:34:56,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:34:56,558 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:34:56,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:34:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:56,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:56,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:56,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439033588] [2023-02-15 13:34:56,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439033588] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:56,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:56,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:34:56,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63208118] [2023-02-15 13:34:56,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:56,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:34:56,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:56,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:34:56,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:34:56,942 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2023-02-15 13:34:56,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:56,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:34:56,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2023-02-15 13:34:56,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:34:57,187 INFO L130 PetriNetUnfolder]: 169/408 cut-off events. [2023-02-15 13:34:57,188 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2023-02-15 13:34:57,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 408 events. 169/408 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 2229 event pairs, 75 based on Foata normal form. 9/176 useless extension candidates. Maximal degree in co-relation 1027. Up to 232 conditions per place. [2023-02-15 13:34:57,190 INFO L137 encePairwiseOnDemand]: 319/333 looper letters, 47 selfloop transitions, 17 changer transitions 0/64 dead transitions. [2023-02-15 13:34:57,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 377 flow [2023-02-15 13:34:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:34:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-02-15 13:34:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2023-02-15 13:34:57,192 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42242242242242245 [2023-02-15 13:34:57,192 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 844 transitions. [2023-02-15 13:34:57,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 844 transitions. [2023-02-15 13:34:57,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:34:57,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 844 transitions. [2023-02-15 13:34:57,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.66666666666666) internal successors, (844), 6 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:57,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:57,196 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:57,197 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 240 flow. Second operand 6 states and 844 transitions. [2023-02-15 13:34:57,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 377 flow [2023-02-15 13:34:57,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-02-15 13:34:57,198 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 246 flow [2023-02-15 13:34:57,199 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-02-15 13:34:57,199 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-02-15 13:34:57,199 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 246 flow [2023-02-15 13:34:57,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:57,200 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:34:57,200 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:57,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:57,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:57,408 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:34:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1435990122, now seen corresponding path program 1 times [2023-02-15 13:34:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:57,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906235291] [2023-02-15 13:34:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:57,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:57,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:57,411 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:57,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 13:34:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:57,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 13:34:57,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:57,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:34:57,627 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-15 13:34:57,648 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 13:34:57,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2023-02-15 13:34:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:57,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:57,697 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 36 treesize of output 32 [2023-02-15 13:34:57,798 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 13:34:57,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2023-02-15 13:34:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:57,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:57,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906235291] [2023-02-15 13:34:57,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906235291] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:57,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:34:57,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2023-02-15 13:34:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921939920] [2023-02-15 13:34:57,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:57,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:34:57,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:57,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:34:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:34:59,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:35:00,459 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 333 [2023-02-15 13:35:00,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 246 flow. Second operand has 9 states, 9 states have (on average 107.66666666666667) internal successors, (969), 9 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:35:00,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:35:00,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 333 [2023-02-15 13:35:00,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:35:00,791 INFO L130 PetriNetUnfolder]: 168/404 cut-off events. [2023-02-15 13:35:00,791 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2023-02-15 13:35:00,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 404 events. 168/404 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 2178 event pairs, 77 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 1075. Up to 202 conditions per place. [2023-02-15 13:35:00,793 INFO L137 encePairwiseOnDemand]: 321/333 looper letters, 51 selfloop transitions, 14 changer transitions 0/65 dead transitions. [2023-02-15 13:35:00,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 405 flow [2023-02-15 13:35:00,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:35:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-02-15 13:35:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2023-02-15 13:35:00,795 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35315315315315315 [2023-02-15 13:35:00,795 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2023-02-15 13:35:00,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2023-02-15 13:35:00,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:35:00,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2023-02-15 13:35:00,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:35:00,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:35:00,798 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:35:00,798 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 246 flow. Second operand 5 states and 588 transitions. [2023-02-15 13:35:00,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 405 flow [2023-02-15 13:35:00,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 377 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-02-15 13:35:00,799 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 240 flow [2023-02-15 13:35:00,799 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-02-15 13:35:00,800 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2023-02-15 13:35:00,800 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 240 flow [2023-02-15 13:35:00,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.66666666666667) internal successors, (969), 9 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:35:00,800 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:35:00,800 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:35:00,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:35:01,009 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-15 13:35:01,009 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:35:01,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:35:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1435990123, now seen corresponding path program 1 times [2023-02-15 13:35:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:35:01,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279181000] [2023-02-15 13:35:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:35:01,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:35:01,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:35:01,012 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-15 13:35:01,014 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-15 13:35:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:35:01,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 13:35:01,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:35:01,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:35:01,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:35:01,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:35:01,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:35:01,242 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:35:01,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:35:01,288 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-15 13:35:01,293 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-15 13:35:01,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:35:01,318 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 16 treesize of output 18 [2023-02-15 13:35:01,327 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-15 13:35:01,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-02-15 13:35:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:35:01,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:35:01,493 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 66 treesize of output 62 [2023-02-15 13:35:01,498 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 102 treesize of output 94 [2023-02-15 13:35:02,077 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 40 treesize of output 32 [2023-02-15 13:35:40,265 WARN L233 SmtUtils]: Spent 38.01s on a formula simplification. DAG size of input: 78 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:35:40,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:35:40,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 117 [2023-02-15 13:35:45,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:35:45,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:35:45,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279181000] [2023-02-15 13:35:45,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279181000] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:35:45,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:35:45,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2023-02-15 13:35:45,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184236944] [2023-02-15 13:35:45,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:35:45,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:35:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:35:45,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:35:45,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2023-02-15 13:35:47,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:35:49,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:35:51,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:35:54,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:35:56,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:35:58,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:00,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:02,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:05,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:07,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:09,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:11,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:13,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:15,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:18,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:20,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:22,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:25,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:27,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:29,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:31,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:34,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:36,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:38,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:40,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:42,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:44,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:46,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:48,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:50,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:53,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:55,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:36:57,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:37:00,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:37:01,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:37:03,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:37:05,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:37:08,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:37:08,011 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 333 [2023-02-15 13:37:08,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 240 flow. Second operand has 11 states, 11 states have (on average 78.63636363636364) internal successors, (865), 11 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:08,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:37:08,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 333 [2023-02-15 13:37:08,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:37:08,607 INFO L130 PetriNetUnfolder]: 171/407 cut-off events. [2023-02-15 13:37:08,607 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-02-15 13:37:08,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 407 events. 171/407 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2186 event pairs, 77 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 1123. Up to 196 conditions per place. [2023-02-15 13:37:08,608 INFO L137 encePairwiseOnDemand]: 321/333 looper letters, 53 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2023-02-15 13:37:08,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 410 flow [2023-02-15 13:37:08,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:37:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-02-15 13:37:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2023-02-15 13:37:08,610 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.26126126126126126 [2023-02-15 13:37:08,610 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 522 transitions. [2023-02-15 13:37:08,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 522 transitions. [2023-02-15 13:37:08,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:37:08,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 522 transitions. [2023-02-15 13:37:08,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:08,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:08,613 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:08,614 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 240 flow. Second operand 6 states and 522 transitions. [2023-02-15 13:37:08,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 410 flow [2023-02-15 13:37:08,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 66 transitions, 408 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-02-15 13:37:08,615 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 283 flow [2023-02-15 13:37:08,615 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-02-15 13:37:08,616 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2023-02-15 13:37:08,616 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 283 flow [2023-02-15 13:37:08,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 78.63636363636364) internal successors, (865), 11 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:08,616 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:37:08,616 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:37:08,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:37:08,824 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-15 13:37:08,825 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:37:08,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:37:08,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1079523238, now seen corresponding path program 1 times [2023-02-15 13:37:08,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:37:08,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785946040] [2023-02-15 13:37:08,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:37:08,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:37:08,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:37:08,839 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:37:08,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 13:37:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:37:08,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 13:37:08,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:37:09,010 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:37:09,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2023-02-15 13:37:09,027 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:37:09,027 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-15 13:37:09,058 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:37:09,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:37:09,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:37:09,093 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:37:09,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 13:37:09,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:37:09,182 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-02-15 13:37:09,183 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 3 case distinctions, treesize of input 39 treesize of output 50 [2023-02-15 13:37:09,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:37:09,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 56 [2023-02-15 13:37:09,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-15 13:37:09,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:37:09,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:37:09,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785946040] [2023-02-15 13:37:09,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785946040] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:37:09,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:37:09,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:37:09,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020864388] [2023-02-15 13:37:09,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:37:09,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:37:09,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:37:09,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:37:09,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:37:10,518 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 333 [2023-02-15 13:37:10,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:10,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:37:10,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 333 [2023-02-15 13:37:10,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:37:18,727 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 45 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:37:19,051 INFO L130 PetriNetUnfolder]: 87/265 cut-off events. [2023-02-15 13:37:19,051 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2023-02-15 13:37:19,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 265 events. 87/265 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1398 event pairs, 43 based on Foata normal form. 2/159 useless extension candidates. Maximal degree in co-relation 816. Up to 127 conditions per place. [2023-02-15 13:37:19,052 INFO L137 encePairwiseOnDemand]: 317/333 looper letters, 52 selfloop transitions, 20 changer transitions 0/72 dead transitions. [2023-02-15 13:37:19,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 487 flow [2023-02-15 13:37:19,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:37:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-02-15 13:37:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1084 transitions. [2023-02-15 13:37:19,056 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4069069069069069 [2023-02-15 13:37:19,056 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1084 transitions. [2023-02-15 13:37:19,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1084 transitions. [2023-02-15 13:37:19,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:37:19,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1084 transitions. [2023-02-15 13:37:19,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.5) internal successors, (1084), 8 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:19,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 333.0) internal successors, (2997), 9 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:19,061 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 333.0) internal successors, (2997), 9 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:19,061 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 283 flow. Second operand 8 states and 1084 transitions. [2023-02-15 13:37:19,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 487 flow [2023-02-15 13:37:19,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 464 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-02-15 13:37:19,070 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 366 flow [2023-02-15 13:37:19,070 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=366, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2023-02-15 13:37:19,070 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-02-15 13:37:19,070 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 366 flow [2023-02-15 13:37:19,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:19,071 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:37:19,071 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:37:19,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 (13)] Forceful destruction successful, exit code 0 [2023-02-15 13:37:19,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:37:19,271 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting deleteErr8ASSERT_VIOLATIONMEMORY_FREE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:37:19,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:37:19,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1960268591, now seen corresponding path program 1 times [2023-02-15 13:37:19,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:37:19,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765106445] [2023-02-15 13:37:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:37:19,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:37:19,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:37:19,273 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:37:19,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 13:37:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:37:19,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 13:37:19,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:37:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:37:19,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:37:19,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:37:19,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765106445] [2023-02-15 13:37:19,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765106445] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:37:19,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:37:19,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:37:19,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130648042] [2023-02-15 13:37:19,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:37:19,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:37:19,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:37:19,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:37:19,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:37:19,480 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 333 [2023-02-15 13:37:19,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:19,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:37:19,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 333 [2023-02-15 13:37:19,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:37:19,623 INFO L130 PetriNetUnfolder]: 77/235 cut-off events. [2023-02-15 13:37:19,624 INFO L131 PetriNetUnfolder]: For 284/284 co-relation queries the response was YES. [2023-02-15 13:37:19,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 235 events. 77/235 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1135 event pairs, 51 based on Foata normal form. 4/161 useless extension candidates. Maximal degree in co-relation 792. Up to 172 conditions per place. [2023-02-15 13:37:19,625 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 50 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-02-15 13:37:19,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 52 transitions, 416 flow [2023-02-15 13:37:19,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:37:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-02-15 13:37:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2023-02-15 13:37:19,627 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45570570570570573 [2023-02-15 13:37:19,627 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 607 transitions. [2023-02-15 13:37:19,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 607 transitions. [2023-02-15 13:37:19,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:37:19,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 607 transitions. [2023-02-15 13:37:19,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:19,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:19,630 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:19,630 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 366 flow. Second operand 4 states and 607 transitions. [2023-02-15 13:37:19,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 52 transitions, 416 flow [2023-02-15 13:37:19,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 52 transitions, 392 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-02-15 13:37:19,631 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 292 flow [2023-02-15 13:37:19,631 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2023-02-15 13:37:19,632 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2023-02-15 13:37:19,632 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 292 flow [2023-02-15 13:37:19,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:19,632 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:37:19,632 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:37:19,642 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 (14)] Ended with exit code 0 [2023-02-15 13:37:19,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:37:19,840 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting deleteErr7ASSERT_VIOLATIONMEMORY_FREE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:37:19,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:37:19,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1960268588, now seen corresponding path program 1 times [2023-02-15 13:37:19,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:37:19,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542065722] [2023-02-15 13:37:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:37:19,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:37:19,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:37:19,842 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:37:19,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 13:37:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:37:19,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:37:19,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:37:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:37:19,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:37:19,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:37:19,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542065722] [2023-02-15 13:37:19,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542065722] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:37:19,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:37:19,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:37:19,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340174410] [2023-02-15 13:37:19,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:37:19,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:37:19,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:37:19,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:37:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:37:19,974 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 333 [2023-02-15 13:37:19,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:19,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:37:19,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 333 [2023-02-15 13:37:19,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:37:20,101 INFO L130 PetriNetUnfolder]: 77/227 cut-off events. [2023-02-15 13:37:20,101 INFO L131 PetriNetUnfolder]: For 222/222 co-relation queries the response was YES. [2023-02-15 13:37:20,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 227 events. 77/227 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1040 event pairs, 51 based on Foata normal form. 4/153 useless extension candidates. Maximal degree in co-relation 718. Up to 164 conditions per place. [2023-02-15 13:37:20,102 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 49 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-02-15 13:37:20,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 51 transitions, 380 flow [2023-02-15 13:37:20,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:37:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-02-15 13:37:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 604 transitions. [2023-02-15 13:37:20,104 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2023-02-15 13:37:20,104 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 604 transitions. [2023-02-15 13:37:20,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 604 transitions. [2023-02-15 13:37:20,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:37:20,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 604 transitions. [2023-02-15 13:37:20,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:20,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:20,107 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:20,107 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 292 flow. Second operand 4 states and 604 transitions. [2023-02-15 13:37:20,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 51 transitions, 380 flow [2023-02-15 13:37:20,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 51 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-02-15 13:37:20,108 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 279 flow [2023-02-15 13:37:20,109 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-02-15 13:37:20,109 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2023-02-15 13:37:20,109 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 279 flow [2023-02-15 13:37:20,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:20,110 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:37:20,110 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:37:20,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 13:37:20,315 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-15 13:37:20,316 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting deleteErr6ASSERT_VIOLATIONMEMORY_FREE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:37:20,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:37:20,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1960268592, now seen corresponding path program 1 times [2023-02-15 13:37:20,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:37:20,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448518598] [2023-02-15 13:37:20,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:37:20,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:37:20,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:37:20,318 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-15 13:37:20,318 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-15 13:37:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:37:20,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:37:20,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:37:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:37:20,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:37:20,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:37:20,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448518598] [2023-02-15 13:37:20,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448518598] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:37:20,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:37:20,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:37:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852055] [2023-02-15 13:37:20,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:37:20,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:37:20,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:37:20,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:37:20,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:37:20,498 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 333 [2023-02-15 13:37:20,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:20,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:37:20,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 333 [2023-02-15 13:37:20,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:37:20,640 INFO L130 PetriNetUnfolder]: 65/191 cut-off events. [2023-02-15 13:37:20,640 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2023-02-15 13:37:20,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 191 events. 65/191 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 805 event pairs, 39 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 636. Up to 128 conditions per place. [2023-02-15 13:37:20,641 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 43 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-02-15 13:37:20,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 357 flow [2023-02-15 13:37:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:37:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-02-15 13:37:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2023-02-15 13:37:20,643 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4527027027027027 [2023-02-15 13:37:20,643 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 603 transitions. [2023-02-15 13:37:20,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 603 transitions. [2023-02-15 13:37:20,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:37:20,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 603 transitions. [2023-02-15 13:37:20,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:20,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:20,646 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:20,646 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 279 flow. Second operand 4 states and 603 transitions. [2023-02-15 13:37:20,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 357 flow [2023-02-15 13:37:20,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-02-15 13:37:20,647 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 268 flow [2023-02-15 13:37:20,647 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-02-15 13:37:20,648 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2023-02-15 13:37:20,648 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 268 flow [2023-02-15 13:37:20,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:20,648 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:37:20,648 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:37:20,658 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-15 13:37:20,856 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-15 13:37:20,856 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting deleteErr13ASSERT_VIOLATIONMEMORY_FREE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:37:20,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:37:20,857 INFO L85 PathProgramCache]: Analyzing trace with hash 638781747, now seen corresponding path program 1 times [2023-02-15 13:37:20,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:37:20,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636361462] [2023-02-15 13:37:20,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:37:20,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:37:20,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:37:20,858 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:37:20,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 13:37:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:37:20,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 13:37:20,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:37:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:37:20,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:37:20,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:37:20,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636361462] [2023-02-15 13:37:20,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636361462] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:37:20,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:37:20,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:37:20,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387308713] [2023-02-15 13:37:20,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:37:20,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:37:20,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:37:20,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:37:20,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:37:21,025 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 333 [2023-02-15 13:37:21,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:21,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:37:21,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 333 [2023-02-15 13:37:21,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:37:21,164 INFO L130 PetriNetUnfolder]: 31/101 cut-off events. [2023-02-15 13:37:21,164 INFO L131 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2023-02-15 13:37:21,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 101 events. 31/101 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 281 event pairs, 7 based on Foata normal form. 4/87 useless extension candidates. Maximal degree in co-relation 350. Up to 68 conditions per place. [2023-02-15 13:37:21,164 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 35 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2023-02-15 13:37:21,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 36 transitions, 276 flow [2023-02-15 13:37:21,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:37:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 13:37:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-02-15 13:37:21,166 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4394394394394394 [2023-02-15 13:37:21,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-02-15 13:37:21,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-02-15 13:37:21,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:37:21,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-02-15 13:37:21,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:21,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:21,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:21,168 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 268 flow. Second operand 3 states and 439 transitions. [2023-02-15 13:37:21,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 36 transitions, 276 flow [2023-02-15 13:37:21,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 36 transitions, 258 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-02-15 13:37:21,169 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 186 flow [2023-02-15 13:37:21,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-02-15 13:37:21,169 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -14 predicate places. [2023-02-15 13:37:21,169 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 186 flow [2023-02-15 13:37:21,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:21,170 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:37:21,170 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:37:21,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-02-15 13:37:21,377 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-15 13:37:21,378 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:37:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:37:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash 638781655, now seen corresponding path program 1 times [2023-02-15 13:37:21,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:37:21,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877199874] [2023-02-15 13:37:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:37:21,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:37:21,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:37:21,380 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-15 13:37:21,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-15 13:37:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:37:21,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:37:21,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:37:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:37:21,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:37:21,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:37:21,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877199874] [2023-02-15 13:37:21,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877199874] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:37:21,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:37:21,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:37:21,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348533009] [2023-02-15 13:37:21,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:37:21,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:37:21,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:37:21,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:37:21,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:37:21,574 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 333 [2023-02-15 13:37:21,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:21,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 13:37:21,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 333 [2023-02-15 13:37:21,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 13:37:21,706 INFO L130 PetriNetUnfolder]: 25/83 cut-off events. [2023-02-15 13:37:21,706 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-02-15 13:37:21,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 83 events. 25/83 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 197 event pairs, 7 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 298. Up to 68 conditions per place. [2023-02-15 13:37:21,707 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 32 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-02-15 13:37:21,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 248 flow [2023-02-15 13:37:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:37:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 13:37:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-02-15 13:37:21,708 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42542542542542544 [2023-02-15 13:37:21,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-02-15 13:37:21,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-02-15 13:37:21,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 13:37:21,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-02-15 13:37:21,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:21,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:21,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:21,710 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 186 flow. Second operand 3 states and 425 transitions. [2023-02-15 13:37:21,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 248 flow [2023-02-15 13:37:21,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 33 transitions, 247 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-02-15 13:37:21,711 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 181 flow [2023-02-15 13:37:21,711 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-02-15 13:37:21,711 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -16 predicate places. [2023-02-15 13:37:21,712 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 181 flow [2023-02-15 13:37:21,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:37:21,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 13:37:21,712 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:37:21,724 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-15 13:37:21,912 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-15 13:37:21,912 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 13:37:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:37:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash 227566895, now seen corresponding path program 1 times [2023-02-15 13:37:21,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:37:21,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605317826] [2023-02-15 13:37:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:37:21,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:37:21,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:37:21,915 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:37:21,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 13:37:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:37:22,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 13:37:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:37:22,340 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 13:37:22,342 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 13:37:22,343 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (68 of 69 remaining) [2023-02-15 13:37:22,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 69 remaining) [2023-02-15 13:37:22,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 69 remaining) [2023-02-15 13:37:22,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 69 remaining) [2023-02-15 13:37:22,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 69 remaining) [2023-02-15 13:37:22,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 69 remaining) [2023-02-15 13:37:22,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 69 remaining) [2023-02-15 13:37:22,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 69 remaining) [2023-02-15 13:37:22,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 69 remaining) [2023-02-15 13:37:22,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 69 remaining) [2023-02-15 13:37:22,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 69 remaining) [2023-02-15 13:37:22,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 69 remaining) [2023-02-15 13:37:22,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 69 remaining) [2023-02-15 13:37:22,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 69 remaining) [2023-02-15 13:37:22,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 69 remaining) [2023-02-15 13:37:22,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 69 remaining) [2023-02-15 13:37:22,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 69 remaining) [2023-02-15 13:37:22,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 69 remaining) [2023-02-15 13:37:22,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 69 remaining) [2023-02-15 13:37:22,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 69 remaining) [2023-02-15 13:37:22,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 69 remaining) [2023-02-15 13:37:22,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 69 remaining) [2023-02-15 13:37:22,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 69 remaining) [2023-02-15 13:37:22,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 69 remaining) [2023-02-15 13:37:22,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 69 remaining) [2023-02-15 13:37:22,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 69 remaining) [2023-02-15 13:37:22,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 69 remaining) [2023-02-15 13:37:22,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 69 remaining) [2023-02-15 13:37:22,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 69 remaining) [2023-02-15 13:37:22,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 69 remaining) [2023-02-15 13:37:22,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 69 remaining) [2023-02-15 13:37:22,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4ASSERT_VIOLATIONMEMORY_FREE (37 of 69 remaining) [2023-02-15 13:37:22,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12ASSERT_VIOLATIONMEMORY_FREE (36 of 69 remaining) [2023-02-15 13:37:22,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (35 of 69 remaining) [2023-02-15 13:37:22,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13ASSERT_VIOLATIONMEMORY_FREE (34 of 69 remaining) [2023-02-15 13:37:22,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (33 of 69 remaining) [2023-02-15 13:37:22,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14ASSERT_VIOLATIONMEMORY_FREE (32 of 69 remaining) [2023-02-15 13:37:22,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (31 of 69 remaining) [2023-02-15 13:37:22,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (30 of 69 remaining) [2023-02-15 13:37:22,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (29 of 69 remaining) [2023-02-15 13:37:22,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 69 remaining) [2023-02-15 13:37:22,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 69 remaining) [2023-02-15 13:37:22,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 69 remaining) [2023-02-15 13:37:22,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 69 remaining) [2023-02-15 13:37:22,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 69 remaining) [2023-02-15 13:37:22,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 69 remaining) [2023-02-15 13:37:22,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 69 remaining) [2023-02-15 13:37:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 69 remaining) [2023-02-15 13:37:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 69 remaining) [2023-02-15 13:37:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 69 remaining) [2023-02-15 13:37:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 69 remaining) [2023-02-15 13:37:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 69 remaining) [2023-02-15 13:37:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 69 remaining) [2023-02-15 13:37:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 69 remaining) [2023-02-15 13:37:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 69 remaining) [2023-02-15 13:37:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 69 remaining) [2023-02-15 13:37:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 69 remaining) [2023-02-15 13:37:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 69 remaining) [2023-02-15 13:37:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 69 remaining) [2023-02-15 13:37:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 69 remaining) [2023-02-15 13:37:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4ASSERT_VIOLATIONMEMORY_FREE (8 of 69 remaining) [2023-02-15 13:37:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12ASSERT_VIOLATIONMEMORY_FREE (7 of 69 remaining) [2023-02-15 13:37:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (6 of 69 remaining) [2023-02-15 13:37:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 69 remaining) [2023-02-15 13:37:22,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (4 of 69 remaining) [2023-02-15 13:37:22,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14ASSERT_VIOLATIONMEMORY_FREE (3 of 69 remaining) [2023-02-15 13:37:22,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 69 remaining) [2023-02-15 13:37:22,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (1 of 69 remaining) [2023-02-15 13:37:22,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (0 of 69 remaining) [2023-02-15 13:37:22,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-15 13:37:22,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:37:22,576 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:37:22,580 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-02-15 13:37:22,581 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:37:22,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:37:22 BasicIcfg [2023-02-15 13:37:22,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:37:22,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:37:22,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:37:22,616 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:37:22,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:34:30" (3/4) ... [2023-02-15 13:37:22,618 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 13:37:22,618 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:37:22,618 INFO L158 Benchmark]: Toolchain (without parser) took 173249.78ms. Allocated memory was 54.5MB in the beginning and 117.4MB in the end (delta: 62.9MB). Free memory was 30.4MB in the beginning and 76.3MB in the end (delta: -45.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2023-02-15 13:37:22,618 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 44.0MB. Free memory was 22.3MB in the beginning and 22.3MB in the end (delta: 50.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:37:22,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.55ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 30.3MB in the beginning and 38.1MB in the end (delta: -7.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2023-02-15 13:37:22,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.80ms. Allocated memory is still 69.2MB. Free memory was 38.1MB in the beginning and 35.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 13:37:22,618 INFO L158 Benchmark]: Boogie Preprocessor took 51.14ms. Allocated memory is still 69.2MB. Free memory was 35.6MB in the beginning and 33.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:37:22,618 INFO L158 Benchmark]: RCFGBuilder took 617.25ms. Allocated memory is still 69.2MB. Free memory was 33.5MB in the beginning and 44.0MB in the end (delta: -10.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2023-02-15 13:37:22,619 INFO L158 Benchmark]: TraceAbstraction took 171950.77ms. Allocated memory was 69.2MB in the beginning and 117.4MB in the end (delta: 48.2MB). Free memory was 43.1MB in the beginning and 76.3MB in the end (delta: -33.2MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2023-02-15 13:37:22,619 INFO L158 Benchmark]: Witness Printer took 1.86ms. Allocated memory is still 117.4MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:37:22,620 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 44.0MB. Free memory was 22.3MB in the beginning and 22.3MB in the end (delta: 50.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.55ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 30.3MB in the beginning and 38.1MB in the end (delta: -7.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.80ms. Allocated memory is still 69.2MB. Free memory was 38.1MB in the beginning and 35.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.14ms. Allocated memory is still 69.2MB. Free memory was 35.6MB in the beginning and 33.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 617.25ms. Allocated memory is still 69.2MB. Free memory was 33.5MB in the beginning and 44.0MB in the end (delta: -10.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * TraceAbstraction took 171950.77ms. Allocated memory was 69.2MB in the beginning and 117.4MB in the end (delta: 48.2MB). Free memory was 43.1MB in the beginning and 76.3MB in the end (delta: -33.2MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. * Witness Printer took 1.86ms. Allocated memory is still 117.4MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.2s, 145 PlacesBefore, 62 PlacesAfterwards, 144 TransitionsBefore, 60 TransitionsAfterwards, 960 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 139 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 182 TotalNumberOfCompositions, 1645 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1063, independent: 936, independent conditional: 0, independent unconditional: 936, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 488, independent: 453, independent conditional: 0, independent unconditional: 453, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1063, independent: 483, independent conditional: 0, independent unconditional: 483, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 488, unknown conditional: 0, unknown unconditional: 488] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1069. Possible FailurePath: [L1070] 0 pthread_t id1, id2; [L1071] 0 struct item *list = ((void *)0); [L1072] FCALL, FORK 0 pthread_create(&id1, ((void *)0), build, list) VAL [\old(argc)=5, argc=5, argv={9:6}, argv={9:6}, id1={7:0}, id2={23:0}, list={0:0}, pthread_create(&id1, ((void *)0), build, list)=-1] [L1048] 1 struct item *list = (struct item *)plist; VAL [list={31:0}, plist={0:0}, plist={0:0}] [L1050] CALL 1 append(&list) [L1042] 1 struct item *elem = malloc(sizeof *elem); VAL [elem={1:0}, malloc(sizeof *elem)={1:0}, plist={31:0}, plist={31:0}] [L1043] EXPR 1 \read(**plist) [L1043] 1 elem->next = *plist [L1044] EXPR 1 elem->next [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) VAL [elem={1:0}, elem->next={0:0}, plist={31:0}, plist={31:0}] [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) VAL [(elem->next) ? elem->next->data : malloc(sizeof *elem)={2:0}, elem={1:0}, elem->next={0:0}, malloc(sizeof *elem)={2:0}, plist={31:0}, plist={31:0}] [L1073] 0 \read(id1) VAL [\old(argc)=5, \read(id1)=-1, argc=5, argv={9:6}, argv={9:6}, id1={7:0}, id2={23:0}, list={0:0}] [L1044] 1 elem->data = (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1045] 1 *plist = elem [L1050] RET 1 append(&list) [L1051] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1073] FCALL, JOIN 1 pthread_join(id1, ((void *)0)) VAL [\old(argc)=5, \read(id1)=-1, argc=5, argv={9:6}, argv={9:6}, id1={7:0}, id2={23:0}, list={0:0}] [L1074] FCALL, FORK 0 pthread_create(&id2, ((void *)0), delete, list) VAL [\old(argc)=5, argc=5, argv={9:6}, argv={9:6}, id1={7:0}, id2={23:0}, list={0:0}, plist={0:0}, pthread_create(&id2, ((void *)0), delete, list)=0] [L1075] 0 \read(id2) VAL [\old(argc)=5, \read(id2)=0, argc=5, argv={9:6}, argv={9:6}, id1={7:0}, id2={23:0}, list={0:0}, plist={0:0}] [L1055] 2 struct item *list = (struct item *)plist; [L1056] COND FALSE 2 !(\read(*list)) VAL [list={0:0}, plist={0:0}, plist={0:0}] [L1062] COND FALSE 2 !(\read(*list)) [L1075] FCALL, JOIN 2 pthread_join(id2, ((void *)0)) VAL [\old(argc)=5, \read(id2)=0, \result={0:0}, argc=5, argv={9:6}, argv={9:6}, id1={7:0}, id2={23:0}, list={0:0}, list={0:0}, plist={0:0}, plist={0:0}] [L1076] 0 return 0; [L1076] 0 return 0; [L1076] 0 return 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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: 1072]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1074]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) 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: -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: -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: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 240 locations, 69 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 171.8s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 101.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 19.2s, HoareTripleCheckerStatistics: 38 mSolverCounterUnknown, 3468 SdHoareTripleChecker+Valid, 91.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2312 mSDsluCounter, 723 SdHoareTripleChecker+Invalid, 90.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 500 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4878 IncrementalHoareTripleChecker+Invalid, 5170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 223 mSDtfsCounter, 4878 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 50.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=12, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 45.2s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 139 ConstructedInterpolants, 13 QuantifiedInterpolants, 1434 SizeOfPredicates, 66 NumberOfNonLiveVariables, 2067 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 4/8 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 could not prove your program: unable to determine feasibility of some traces [2023-02-15 13:37:22,669 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 Result: UNKNOWN: Overapproximated counterexample