./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 e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-e8d5503-m [2023-02-15 22:34:42,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:34:42,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:34:42,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:34:42,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:34:42,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:34:42,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:34:42,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:34:42,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:34:42,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:34:42,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:34:42,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:34:42,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:34:42,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:34:42,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:34:42,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:34:42,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:34:42,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:34:42,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:34:42,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:34:42,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:34:42,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:34:42,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:34:42,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:34:42,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:34:42,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:34:42,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:34:42,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:34:42,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:34:42,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:34:42,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:34:42,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:34:42,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:34:42,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:34:42,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:34:42,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:34:42,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:34:42,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:34:42,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:34:42,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:34:42,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:34:42,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:34:42,328 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:34:42,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:34:42,329 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:34:42,329 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:34:42,330 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:34:42,330 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:34:42,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:34:42,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:34:42,331 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:34:42,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:34:42,332 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:34:42,332 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:34:42,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:34:42,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:34:42,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:34:42,333 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:34:42,333 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:34:42,333 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:34:42,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:34:42,333 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:34:42,333 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:34:42,334 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:34:42,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:34:42,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:34:42,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:34:42,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:34:42,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:34:42,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:34:42,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:34:42,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:34:42,335 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:34:42,336 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:34:42,336 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:34:42,336 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:34:42,336 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 22:34:42,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:34:42,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:34:42,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:34:42,594 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:34:42,594 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:34:42,595 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 22:34:43,711 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:34:43,927 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:34:43,927 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2023-02-15 22:34:43,944 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6629be64d/4e8c25fe8fda4722b859afd3f3db9653/FLAG8484d9f46 [2023-02-15 22:34:43,960 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6629be64d/4e8c25fe8fda4722b859afd3f3db9653 [2023-02-15 22:34:43,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:34:43,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:34:43,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:34:43,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:34:43,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:34:43,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:34:43" (1/1) ... [2023-02-15 22:34:43,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44dd2cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:43, skipping insertion in model container [2023-02-15 22:34:43,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:34:43" (1/1) ... [2023-02-15 22:34:43,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:34:44,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:34:44,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:34:44,414 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-15 22:34:44,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4540ead8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:44, skipping insertion in model container [2023-02-15 22:34:44,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:34:44,417 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 22:34:44,419 INFO L158 Benchmark]: Toolchain (without parser) took 454.34ms. Allocated memory is still 161.5MB. Free memory was 113.9MB in the beginning and 100.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 22:34:44,419 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:34:44,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.51ms. Allocated memory is still 161.5MB. Free memory was 113.9MB in the beginning and 100.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 22:34:44,422 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.51ms. Allocated memory is still 161.5MB. Free memory was 113.9MB in the beginning and 100.4MB 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-?-e8d5503-m [2023-02-15 22:34:46,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:34:46,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:34:46,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:34:46,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:34:46,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:34:46,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:34:46,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:34:46,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:34:46,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:34:46,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:34:46,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:34:46,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:34:46,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:34:46,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:34:46,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:34:46,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:34:46,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:34:46,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:34:46,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:34:46,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:34:46,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:34:46,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:34:46,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:34:46,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:34:46,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:34:46,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:34:46,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:34:46,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:34:46,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:34:46,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:34:46,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:34:46,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:34:46,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:34:46,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:34:46,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:34:46,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:34:46,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:34:46,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:34:46,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:34:46,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:34:46,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 22:34:46,435 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:34:46,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:34:46,436 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:34:46,436 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:34:46,436 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:34:46,437 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:34:46,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:34:46,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:34:46,438 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:34:46,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:34:46,439 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:34:46,439 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:34:46,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:34:46,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:34:46,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:34:46,440 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:34:46,440 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:34:46,440 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:34:46,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:34:46,440 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:34:46,440 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:34:46,441 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:34:46,441 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:34:46,441 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:34:46,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:34:46,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:34:46,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:34:46,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:34:46,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:34:46,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:34:46,442 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:34:46,443 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:34:46,443 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:34:46,443 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:34:46,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:34:46,443 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:34:46,444 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:34:46,444 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 22:34:46,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:34:46,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:34:46,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:34:46,784 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:34:46,784 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:34:46,785 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 22:34:47,983 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:34:48,271 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:34:48,275 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2023-02-15 22:34:48,292 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb0c73ca0/8312515f937543c2ab9c9b5f6072ca2b/FLAG14b8821a3 [2023-02-15 22:34:48,303 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb0c73ca0/8312515f937543c2ab9c9b5f6072ca2b [2023-02-15 22:34:48,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:34:48,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:34:48,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:34:48,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:34:48,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:34:48,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:48,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a3d12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48, skipping insertion in model container [2023-02-15 22:34:48,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:48,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:34:48,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:34:48,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:34:48,753 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 22:34:48,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:34:48,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:34:48,818 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:34:48,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:34:48,930 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:34:48,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48 WrapperNode [2023-02-15 22:34:48,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:34:48,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:34:48,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:34:48,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:34:48,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:48,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:48,993 INFO L138 Inliner]: procedures = 267, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-02-15 22:34:48,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:34:48,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:34:48,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:34:48,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:34:49,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:49,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:49,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:49,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:49,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:49,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:49,033 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:49,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:49,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:34:49,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:34:49,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:34:49,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:34:49,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:49,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:34:49,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:34:49,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 22:34:49,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 22:34:49,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 22:34:49,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 22:34:49,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:34:49,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 22:34:49,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:34:49,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:34:49,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:34:49,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:34:49,128 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2023-02-15 22:34:49,128 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2023-02-15 22:34:49,129 INFO L130 BoogieDeclarations]: Found specification of procedure build [2023-02-15 22:34:49,129 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2023-02-15 22:34:49,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:34:49,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:34:49,130 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 22:34:49,328 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:34:49,330 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:34:49,705 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:34:49,711 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:34:49,712 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:34:49,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:34:49 BoogieIcfgContainer [2023-02-15 22:34:49,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:34:49,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:34:49,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:34:49,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:34:49,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:34:48" (1/3) ... [2023-02-15 22:34:49,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb186f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:34:49, skipping insertion in model container [2023-02-15 22:34:49,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48" (2/3) ... [2023-02-15 22:34:49,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb186f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:34:49, skipping insertion in model container [2023-02-15 22:34:49,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:34:49" (3/3) ... [2023-02-15 22:34:49,721 INFO L112 eAbstractionObserver]: Analyzing ICFG list1.i [2023-02-15 22:34:49,735 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:34:49,736 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-02-15 22:34:49,736 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-02-15 22:34:49,873 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-02-15 22:34:49,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 151 transitions, 318 flow [2023-02-15 22:34:49,982 INFO L130 PetriNetUnfolder]: 6/149 cut-off events. [2023-02-15 22:34:49,982 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-02-15 22:34:49,987 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 22:34:49,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 151 transitions, 318 flow [2023-02-15 22:34:49,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 144 transitions, 300 flow [2023-02-15 22:34:50,000 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-02-15 22:34:50,009 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 144 transitions, 300 flow [2023-02-15 22:34:50,012 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 144 transitions, 300 flow [2023-02-15 22:34:50,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 300 flow [2023-02-15 22:34:50,034 INFO L130 PetriNetUnfolder]: 6/144 cut-off events. [2023-02-15 22:34:50,034 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-02-15 22:34:50,035 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 22:34:50,036 INFO L119 LiptonReduction]: Number of co-enabled transitions 960 [2023-02-15 22:35:10,969 INFO L134 LiptonReduction]: Checked pairs total: 1645 [2023-02-15 22:35:10,969 INFO L136 LiptonReduction]: Total number of compositions: 182 [2023-02-15 22:35:10,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:35:10,986 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;@37b1e5c8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:35:10,987 INFO L358 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2023-02-15 22:35:10,988 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-02-15 22:35:10,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-02-15 22:35:10,988 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:35:10,989 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2023-02-15 22:35:10,989 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 22:35:10,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash 637, now seen corresponding path program 1 times [2023-02-15 22:35:11,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:11,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274148929] [2023-02-15 22:35:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:11,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:11,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:11,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:11,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 22:35:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:11,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 22:35:11,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:11,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:11,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:11,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274148929] [2023-02-15 22:35:11,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274148929] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:11,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:11,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-02-15 22:35:11,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354617126] [2023-02-15 22:35:11,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:11,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 22:35:11,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:11,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 22:35:11,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:35:11,146 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 333 [2023-02-15 22:35:11,148 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 22:35:11,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:35:11,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 333 [2023-02-15 22:35:11,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:35:11,433 INFO L130 PetriNetUnfolder]: 100/235 cut-off events. [2023-02-15 22:35:11,433 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-02-15 22:35:11,434 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 22:35:11,436 INFO L137 encePairwiseOnDemand]: 322/333 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-02-15 22:35:11,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 49 transitions, 204 flow [2023-02-15 22:35:11,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 22:35:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-02-15 22:35:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 348 transitions. [2023-02-15 22:35:11,460 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5225225225225225 [2023-02-15 22:35:11,461 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 348 transitions. [2023-02-15 22:35:11,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 348 transitions. [2023-02-15 22:35:11,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:35:11,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 348 transitions. [2023-02-15 22:35:11,471 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 22:35:11,477 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 22:35:11,478 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 22:35:11,480 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 132 flow. Second operand 2 states and 348 transitions. [2023-02-15 22:35:11,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 49 transitions, 204 flow [2023-02-15 22:35:11,484 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 22:35:11,486 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 102 flow [2023-02-15 22:35:11,488 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 22:35:11,493 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -13 predicate places. [2023-02-15 22:35:11,495 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 102 flow [2023-02-15 22:35:11,496 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 22:35:11,496 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:35:11,497 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-02-15 22:35:11,512 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 22:35:11,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:11,706 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 22:35:11,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash 627788, now seen corresponding path program 1 times [2023-02-15 22:35:11,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:11,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137773442] [2023-02-15 22:35:11,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:11,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:11,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:11,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:11,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 22:35:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:11,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:35:11,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:11,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:11,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:11,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137773442] [2023-02-15 22:35:11,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137773442] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:11,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:11,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 22:35:11,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719333955] [2023-02-15 22:35:11,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:11,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:35:11,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:11,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:35:11,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:35:12,106 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 333 [2023-02-15 22:35:12,107 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 22:35:12,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:35:12,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 333 [2023-02-15 22:35:12,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:35:12,651 INFO L130 PetriNetUnfolder]: 157/376 cut-off events. [2023-02-15 22:35:12,652 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-02-15 22:35:12,652 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 22:35:12,655 INFO L137 encePairwiseOnDemand]: 324/333 looper letters, 82 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2023-02-15 22:35:12,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 92 transitions, 371 flow [2023-02-15 22:35:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:35:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 22:35:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-02-15 22:35:12,658 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4934934934934935 [2023-02-15 22:35:12,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-02-15 22:35:12,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-02-15 22:35:12,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:35:12,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-02-15 22:35:12,660 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 22:35:12,663 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 22:35:12,664 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 22:35:12,664 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 102 flow. Second operand 3 states and 493 transitions. [2023-02-15 22:35:12,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 92 transitions, 371 flow [2023-02-15 22:35:12,665 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 22:35:12,666 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 160 flow [2023-02-15 22:35:12,666 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 22:35:12,667 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-02-15 22:35:12,667 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 160 flow [2023-02-15 22:35:12,668 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 22:35:12,668 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:35:12,668 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-02-15 22:35:12,684 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 (3)] Ended with exit code 0 [2023-02-15 22:35:12,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:12,878 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 22:35:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash 627787, now seen corresponding path program 1 times [2023-02-15 22:35:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:12,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154733759] [2023-02-15 22:35:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:12,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:12,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:12,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:12,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 22:35:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:12,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:35:12,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:13,025 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:35:13,028 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 22:35:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:13,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:13,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:13,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154733759] [2023-02-15 22:35:13,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154733759] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:13,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:13,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 22:35:13,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082532256] [2023-02-15 22:35:13,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:13,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:35:13,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:13,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:35:13,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:35:13,220 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 333 [2023-02-15 22:35:13,220 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 22:35:13,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:35:13,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 333 [2023-02-15 22:35:13,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:35:13,444 INFO L130 PetriNetUnfolder]: 181/437 cut-off events. [2023-02-15 22:35:13,444 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-02-15 22:35:13,445 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 22:35:13,448 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 56 selfloop transitions, 8 changer transitions 0/66 dead transitions. [2023-02-15 22:35:13,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 317 flow [2023-02-15 22:35:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:35:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 22:35:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-02-15 22:35:13,450 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4574574574574575 [2023-02-15 22:35:13,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-02-15 22:35:13,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-02-15 22:35:13,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:35:13,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-02-15 22:35:13,461 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 22:35:13,464 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 22:35:13,465 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 22:35:13,465 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 160 flow. Second operand 3 states and 457 transitions. [2023-02-15 22:35:13,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 317 flow [2023-02-15 22:35:13,469 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 22:35:13,472 INFO L231 Difference]: Finished difference. Result has 53 places, 57 transitions, 182 flow [2023-02-15 22:35:13,472 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 22:35:13,473 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-02-15 22:35:13,474 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 182 flow [2023-02-15 22:35:13,474 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 22:35:13,474 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:35:13,475 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 22:35:13,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:13,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:13,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:35:13,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash 603289611, now seen corresponding path program 1 times [2023-02-15 22:35:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:13,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806142874] [2023-02-15 22:35:13,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:13,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:13,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:13,687 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:13,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 22:35:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:13,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:35:13,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:13,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 22:35:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:13,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:13,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:13,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806142874] [2023-02-15 22:35:13,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806142874] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:13,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:13,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:35:13,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538416710] [2023-02-15 22:35:13,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:13,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:35:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:13,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:35:13,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:35:13,959 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 333 [2023-02-15 22:35:13,959 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 22:35:13,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:35:13,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 333 [2023-02-15 22:35:13,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:35:14,185 INFO L130 PetriNetUnfolder]: 179/431 cut-off events. [2023-02-15 22:35:14,185 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-02-15 22:35:14,186 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 22:35:14,188 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 54 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2023-02-15 22:35:14,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 317 flow [2023-02-15 22:35:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:35:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 22:35:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2023-02-15 22:35:14,190 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4754754754754755 [2023-02-15 22:35:14,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2023-02-15 22:35:14,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2023-02-15 22:35:14,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:35:14,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2023-02-15 22:35:14,192 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 22:35:14,194 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 22:35:14,195 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 22:35:14,195 INFO L175 Difference]: Start difference. First operand has 53 places, 57 transitions, 182 flow. Second operand 3 states and 475 transitions. [2023-02-15 22:35:14,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 317 flow [2023-02-15 22:35:14,197 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 22:35:14,198 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 182 flow [2023-02-15 22:35:14,198 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 22:35:14,199 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-02-15 22:35:14,199 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 182 flow [2023-02-15 22:35:14,199 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 22:35:14,200 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:35:14,200 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 22:35:14,214 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 22:35:14,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:14,414 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:35:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash 603289610, now seen corresponding path program 1 times [2023-02-15 22:35:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:14,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779537014] [2023-02-15 22:35:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:14,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:14,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:14,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 22:35:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:14,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:35:14,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:14,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:35:14,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 22:35:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:14,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:14,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:14,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779537014] [2023-02-15 22:35:14,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779537014] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:14,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:14,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:35:14,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252911368] [2023-02-15 22:35:14,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:14,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:35:14,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:14,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:35:14,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:35:14,764 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 333 [2023-02-15 22:35:14,765 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 22:35:14,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:35:14,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 333 [2023-02-15 22:35:14,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:35:14,998 INFO L130 PetriNetUnfolder]: 177/425 cut-off events. [2023-02-15 22:35:14,998 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2023-02-15 22:35:14,999 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 22:35:15,001 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 53 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-02-15 22:35:15,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 313 flow [2023-02-15 22:35:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:35:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 22:35:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2023-02-15 22:35:15,004 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4744744744744745 [2023-02-15 22:35:15,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2023-02-15 22:35:15,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2023-02-15 22:35:15,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:35:15,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2023-02-15 22:35:15,006 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 22:35:15,008 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 22:35:15,009 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 22:35:15,009 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 182 flow. Second operand 3 states and 474 transitions. [2023-02-15 22:35:15,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 313 flow [2023-02-15 22:35:15,011 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 22:35:15,012 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 172 flow [2023-02-15 22:35:15,012 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 22:35:15,012 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -10 predicate places. [2023-02-15 22:35:15,013 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 172 flow [2023-02-15 22:35:15,013 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 22:35:15,013 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:35:15,013 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-02-15 22:35:15,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:15,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:15,224 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 22:35:15,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash 19460939, now seen corresponding path program 1 times [2023-02-15 22:35:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:15,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652455613] [2023-02-15 22:35:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:15,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:15,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:15,226 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:15,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 22:35:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:15,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 22:35:15,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:15,374 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:35:15,374 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 22:35:15,386 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 22:35:15,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:35:15,440 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 22:35:15,456 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:35:15,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:35:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:15,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:15,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:15,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652455613] [2023-02-15 22:35:15,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652455613] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:15,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:15,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:35:15,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75259204] [2023-02-15 22:35:15,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:15,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:35:15,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:15,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:35:15,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:35:15,839 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 333 [2023-02-15 22:35:15,840 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 22:35:15,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:35:15,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 333 [2023-02-15 22:35:15,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:35:16,111 INFO L130 PetriNetUnfolder]: 166/402 cut-off events. [2023-02-15 22:35:16,112 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-02-15 22:35:16,112 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 22:35:16,114 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 50 selfloop transitions, 9 changer transitions 0/61 dead transitions. [2023-02-15 22:35:16,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 305 flow [2023-02-15 22:35:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:35:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-02-15 22:35:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2023-02-15 22:35:16,117 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4286786786786787 [2023-02-15 22:35:16,117 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2023-02-15 22:35:16,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2023-02-15 22:35:16,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:35:16,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2023-02-15 22:35:16,120 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 22:35:16,122 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 22:35:16,123 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 22:35:16,123 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 172 flow. Second operand 4 states and 571 transitions. [2023-02-15 22:35:16,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 305 flow [2023-02-15 22:35:16,124 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 22:35:16,125 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 172 flow [2023-02-15 22:35:16,125 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 22:35:16,126 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -10 predicate places. [2023-02-15 22:35:16,126 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 172 flow [2023-02-15 22:35:16,127 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 22:35:16,127 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:35:16,127 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 22:35:16,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:16,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:16,337 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:35:16,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash 603291194, now seen corresponding path program 1 times [2023-02-15 22:35:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:16,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769454586] [2023-02-15 22:35:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:16,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:16,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:16,340 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:16,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 22:35:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:16,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 22:35:16,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:16,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:16,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:16,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769454586] [2023-02-15 22:35:16,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769454586] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:16,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:16,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:35:16,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059013994] [2023-02-15 22:35:16,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:16,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:35:16,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:16,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:35:16,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:35:16,742 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 333 [2023-02-15 22:35:16,743 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 22:35:16,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:35:16,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 333 [2023-02-15 22:35:16,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:35:17,234 INFO L130 PetriNetUnfolder]: 179/444 cut-off events. [2023-02-15 22:35:17,234 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-02-15 22:35:17,235 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 22:35:17,237 INFO L137 encePairwiseOnDemand]: 322/333 looper letters, 54 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2023-02-15 22:35:17,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 342 flow [2023-02-15 22:35:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:35:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-02-15 22:35:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1003 transitions. [2023-02-15 22:35:17,241 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4302874302874303 [2023-02-15 22:35:17,241 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1003 transitions. [2023-02-15 22:35:17,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1003 transitions. [2023-02-15 22:35:17,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:35:17,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1003 transitions. [2023-02-15 22:35:17,244 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 22:35:17,247 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 22:35:17,247 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 22:35:17,247 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 172 flow. Second operand 7 states and 1003 transitions. [2023-02-15 22:35:17,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 342 flow [2023-02-15 22:35:17,249 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 22:35:17,250 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 229 flow [2023-02-15 22:35:17,250 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 22:35:17,251 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-02-15 22:35:17,251 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 229 flow [2023-02-15 22:35:17,251 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 22:35:17,251 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:35:17,252 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:17,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:17,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:17,462 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:35:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:17,462 INFO L85 PathProgramCache]: Analyzing trace with hash -57764152, now seen corresponding path program 1 times [2023-02-15 22:35:17,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:17,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492916623] [2023-02-15 22:35:17,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:17,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:17,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:17,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:17,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 22:35:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:17,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:35:17,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:17,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 22:35:17,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:35:17,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:35:17,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:35:17,631 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:35:17,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:35:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:17,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:17,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:17,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492916623] [2023-02-15 22:35:17,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492916623] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:17,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:17,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:35:17,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109658442] [2023-02-15 22:35:17,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:17,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:35:17,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:17,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:35:17,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:35:17,839 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 333 [2023-02-15 22:35:17,840 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 22:35:17,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:35:17,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 333 [2023-02-15 22:35:17,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:35:18,058 INFO L130 PetriNetUnfolder]: 179/430 cut-off events. [2023-02-15 22:35:18,059 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2023-02-15 22:35:18,059 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 22:35:18,061 INFO L137 encePairwiseOnDemand]: 324/333 looper letters, 58 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2023-02-15 22:35:18,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 382 flow [2023-02-15 22:35:18,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:35:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-02-15 22:35:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-02-15 22:35:18,063 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41291291291291293 [2023-02-15 22:35:18,064 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-02-15 22:35:18,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-02-15 22:35:18,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:35:18,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-02-15 22:35:18,065 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 22:35:18,067 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 22:35:18,068 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 22:35:18,068 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 229 flow. Second operand 4 states and 550 transitions. [2023-02-15 22:35:18,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 382 flow [2023-02-15 22:35:18,069 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 22:35:18,070 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 240 flow [2023-02-15 22:35:18,070 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 22:35:18,071 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2023-02-15 22:35:18,071 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 240 flow [2023-02-15 22:35:18,071 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 22:35:18,071 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:35:18,071 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:18,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-02-15 22:35:18,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:18,281 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:35:18,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:18,282 INFO L85 PathProgramCache]: Analyzing trace with hash -57763943, now seen corresponding path program 1 times [2023-02-15 22:35:18,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:18,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870835758] [2023-02-15 22:35:18,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:18,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:18,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:18,284 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:18,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 22:35:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:18,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:35:18,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:18,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:35:18,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:35:18,440 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 22:35:18,450 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:35:18,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:35:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:18,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:18,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:18,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870835758] [2023-02-15 22:35:18,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870835758] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:18,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:18,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:35:18,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995748530] [2023-02-15 22:35:18,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:18,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:35:18,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:18,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:35:18,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:35:18,875 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2023-02-15 22:35:18,876 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 22:35:18,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:35:18,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2023-02-15 22:35:18,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:35:19,152 INFO L130 PetriNetUnfolder]: 169/408 cut-off events. [2023-02-15 22:35:19,152 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2023-02-15 22:35:19,153 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 22:35:19,155 INFO L137 encePairwiseOnDemand]: 319/333 looper letters, 47 selfloop transitions, 17 changer transitions 0/64 dead transitions. [2023-02-15 22:35:19,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 377 flow [2023-02-15 22:35:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:35:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-02-15 22:35:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2023-02-15 22:35:19,163 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42242242242242245 [2023-02-15 22:35:19,163 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 844 transitions. [2023-02-15 22:35:19,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 844 transitions. [2023-02-15 22:35:19,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:35:19,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 844 transitions. [2023-02-15 22:35:19,165 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 22:35:19,168 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 22:35:19,168 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 22:35:19,168 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 240 flow. Second operand 6 states and 844 transitions. [2023-02-15 22:35:19,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 377 flow [2023-02-15 22:35:19,170 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 22:35:19,171 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 246 flow [2023-02-15 22:35:19,171 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 22:35:19,172 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-02-15 22:35:19,172 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 246 flow [2023-02-15 22:35:19,173 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 22:35:19,173 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:35:19,173 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:19,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-02-15 22:35:19,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:19,385 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:35:19,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:19,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1435990122, now seen corresponding path program 1 times [2023-02-15 22:35:19,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:19,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144275593] [2023-02-15 22:35:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:19,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:19,388 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:19,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 22:35:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:19,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 22:35:19,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:19,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 22:35:19,611 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 22:35:19,636 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 22:35:19,636 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 22:35:19,651 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 22:35:19,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:35:19,707 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 22:35:19,843 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 22:35:19,843 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 22:35:19,877 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 22:35:19,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:19,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144275593] [2023-02-15 22:35:19,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144275593] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:35:19,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:35:19,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2023-02-15 22:35:19,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798326448] [2023-02-15 22:35:19,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:35:19,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:35:19,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:19,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:35:19,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:35:21,981 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 22:35:22,754 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 333 [2023-02-15 22:35:22,755 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 22:35:22,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:35:22,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 333 [2023-02-15 22:35:22,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:35:23,191 INFO L130 PetriNetUnfolder]: 168/404 cut-off events. [2023-02-15 22:35:23,191 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2023-02-15 22:35:23,192 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 22:35:23,193 INFO L137 encePairwiseOnDemand]: 321/333 looper letters, 51 selfloop transitions, 14 changer transitions 0/65 dead transitions. [2023-02-15 22:35:23,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 405 flow [2023-02-15 22:35:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:35:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-02-15 22:35:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2023-02-15 22:35:23,196 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35315315315315315 [2023-02-15 22:35:23,196 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2023-02-15 22:35:23,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2023-02-15 22:35:23,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:35:23,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2023-02-15 22:35:23,198 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 22:35:23,199 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 22:35:23,200 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 22:35:23,200 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 246 flow. Second operand 5 states and 588 transitions. [2023-02-15 22:35:23,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 405 flow [2023-02-15 22:35:23,201 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 22:35:23,202 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 240 flow [2023-02-15 22:35:23,203 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 22:35:23,203 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2023-02-15 22:35:23,203 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 240 flow [2023-02-15 22:35:23,204 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 22:35:23,204 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:35:23,204 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:23,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:23,416 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 22:35:23,416 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:35:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1435990123, now seen corresponding path program 1 times [2023-02-15 22:35:23,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:23,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839586057] [2023-02-15 22:35:23,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:23,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:23,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:23,418 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 22:35:23,420 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 22:35:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:23,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 22:35:23,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:23,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 22:35:23,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:35:23,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:35:23,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:35:23,660 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:35:23,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:35:23,697 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 22:35:23,702 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 22:35:23,743 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-15 22:35:23,743 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 22:35:23,749 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 22:35:23,766 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 22:35:23,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:35:23,959 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 22:35:23,966 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 22:35:24,432 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 22:35:35,900 WARN L233 SmtUtils]: Spent 11.16s on a formula simplification. DAG size of input: 65 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:35:35,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:35:35,953 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 48 treesize of output 72 [2023-02-15 22:35:38,477 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 22:35:38,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:38,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839586057] [2023-02-15 22:35:38,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839586057] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:35:38,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:35:38,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-15 22:35:38,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291609581] [2023-02-15 22:35:38,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:35:38,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:35:38,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:38,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:35:38,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2023-02-15 22:35:40,944 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 22:35:42,967 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 22:35:45,054 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 22:35:47,171 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 22:35:48,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:35:50,863 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 22:35:52,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:35:55,098 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 22:35:57,181 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 22:35:59,386 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 22:36:01,604 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 22:36:03,781 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 22:36:05,812 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 22:36:08,156 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 22:36:10,246 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 22:36:12,576 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 22:36:14,707 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 22:36:16,789 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 22:36:19,928 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 22:36:22,051 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 22:36:24,087 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 22:36:26,406 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 22:36:28,612 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 22:36:30,725 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 22:36:32,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:36:34,932 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 22:36:37,053 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 22:36:39,352 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 22:36:41,428 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 22:36:43,693 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 22:36:45,791 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 22:36:47,871 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 22:36:49,978 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 22:36:52,065 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 22:36:54,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:36:56,260 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 22:36:56,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 333 [2023-02-15 22:36:56,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 240 flow. Second operand has 10 states, 10 states have (on average 78.7) internal successors, (787), 10 states have internal predecessors, (787), 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 22:36:56,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:36:56,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 333 [2023-02-15 22:36:56,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:36:56,942 INFO L130 PetriNetUnfolder]: 167/400 cut-off events. [2023-02-15 22:36:56,942 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2023-02-15 22:36:56,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 400 events. 167/400 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2150 event pairs, 76 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 1102. Up to 202 conditions per place. [2023-02-15 22:36:56,944 INFO L137 encePairwiseOnDemand]: 321/333 looper letters, 50 selfloop transitions, 14 changer transitions 0/64 dead transitions. [2023-02-15 22:36:56,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 398 flow [2023-02-15 22:36:56,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:36:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-02-15 22:36:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2023-02-15 22:36:56,946 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.26546546546546546 [2023-02-15 22:36:56,946 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 442 transitions. [2023-02-15 22:36:56,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 442 transitions. [2023-02-15 22:36:56,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:36:56,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 442 transitions. [2023-02-15 22:36:56,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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 22:36:56,950 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 22:36:56,950 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 22:36:56,951 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 240 flow. Second operand 5 states and 442 transitions. [2023-02-15 22:36:56,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 398 flow [2023-02-15 22:36:56,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-02-15 22:36:56,952 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 261 flow [2023-02-15 22:36:56,953 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=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-02-15 22:36:56,953 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-02-15 22:36:56,953 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 261 flow [2023-02-15 22:36:56,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 78.7) internal successors, (787), 10 states have internal predecessors, (787), 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 22:36:56,954 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:36:56,954 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:36:56,965 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 22:36:57,165 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 22:36:57,165 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 22:36:57,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:36:57,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1079523238, now seen corresponding path program 1 times [2023-02-15 22:36:57,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:36:57,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608911612] [2023-02-15 22:36:57,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:36:57,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:36:57,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:36:57,167 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:36:57,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 22:36:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:36:57,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:36:57,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:36:57,338 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:36:57,338 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 22:36:57,366 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:36:57,366 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 22:36:57,414 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:36:57,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:36:57,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:36:57,474 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:36:57,474 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 22:36:57,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 22:36:57,602 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-02-15 22:36:57,602 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 22:36:57,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:36:57,635 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 22:36:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:36:58,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:36:58,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:36:58,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608911612] [2023-02-15 22:36:58,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608911612] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:36:58,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:36:58,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:36:58,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679865092] [2023-02-15 22:36:58,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:36:58,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:36:58,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:36:58,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:36:58,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:37:01,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:37:02,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 333 [2023-02-15 22:37:02,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 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 22:37:02,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:37:02,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 333 [2023-02-15 22:37:02,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:37:10,269 WARN L233 SmtUtils]: Spent 8.07s 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 22:37:10,672 INFO L130 PetriNetUnfolder]: 83/258 cut-off events. [2023-02-15 22:37:10,673 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2023-02-15 22:37:10,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 258 events. 83/258 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1366 event pairs, 42 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 765. Up to 120 conditions per place. [2023-02-15 22:37:10,674 INFO L137 encePairwiseOnDemand]: 317/333 looper letters, 50 selfloop transitions, 20 changer transitions 0/70 dead transitions. [2023-02-15 22:37:10,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 461 flow [2023-02-15 22:37:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:37:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-02-15 22:37:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1076 transitions. [2023-02-15 22:37:10,676 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4039039039039039 [2023-02-15 22:37:10,677 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1076 transitions. [2023-02-15 22:37:10,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1076 transitions. [2023-02-15 22:37:10,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:37:10,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1076 transitions. [2023-02-15 22:37:10,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.5) internal successors, (1076), 8 states have internal predecessors, (1076), 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 22:37:10,682 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 22:37:10,683 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 22:37:10,683 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 261 flow. Second operand 8 states and 1076 transitions. [2023-02-15 22:37:10,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 461 flow [2023-02-15 22:37:10,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 440 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-02-15 22:37:10,685 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 346 flow [2023-02-15 22:37:10,685 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=346, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2023-02-15 22:37:10,686 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2023-02-15 22:37:10,686 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 346 flow [2023-02-15 22:37:10,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 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 22:37:10,687 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:37:10,687 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:37:10,699 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 22:37:10,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:37:10,897 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting deleteErr9ASSERT_VIOLATIONMEMORY_FREE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:37:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:37:10,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1960268590, now seen corresponding path program 1 times [2023-02-15 22:37:10,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:37:10,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444360548] [2023-02-15 22:37:10,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:37:10,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:37:10,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:37:10,899 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:37:10,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 22:37:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:37:11,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:37:11,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:37:11,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 22:37:11,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:37:11,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:37:11,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444360548] [2023-02-15 22:37:11,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444360548] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:37:11,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:37:11,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:37:11,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095528215] [2023-02-15 22:37:11,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:37:11,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:37:11,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:37:11,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:37:11,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:37:11,061 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 333 [2023-02-15 22:37:11,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 346 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 22:37:11,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:37:11,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 333 [2023-02-15 22:37:11,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:37:11,245 INFO L130 PetriNetUnfolder]: 73/228 cut-off events. [2023-02-15 22:37:11,245 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2023-02-15 22:37:11,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 228 events. 73/228 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1121 event pairs, 50 based on Foata normal form. 4/157 useless extension candidates. Maximal degree in co-relation 755. Up to 172 conditions per place. [2023-02-15 22:37:11,246 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-02-15 22:37:11,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 50 transitions, 395 flow [2023-02-15 22:37:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:37:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-02-15 22:37:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2023-02-15 22:37:11,248 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45570570570570573 [2023-02-15 22:37:11,248 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 607 transitions. [2023-02-15 22:37:11,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 607 transitions. [2023-02-15 22:37:11,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:37:11,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 607 transitions. [2023-02-15 22:37:11,250 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 22:37:11,252 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 22:37:11,252 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 22:37:11,252 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 346 flow. Second operand 4 states and 607 transitions. [2023-02-15 22:37:11,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 50 transitions, 395 flow [2023-02-15 22:37:11,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 50 transitions, 371 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-02-15 22:37:11,254 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 275 flow [2023-02-15 22:37:11,255 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2023-02-15 22:37:11,255 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2023-02-15 22:37:11,255 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 275 flow [2023-02-15 22:37:11,256 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 22:37:11,256 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:37:11,256 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:37:11,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:37:11,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:37:11,465 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting deleteErr7ASSERT_VIOLATIONMEMORY_FREE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:37:11,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:37:11,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1960268588, now seen corresponding path program 1 times [2023-02-15 22:37:11,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:37:11,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998261775] [2023-02-15 22:37:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:37:11,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:37:11,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:37:11,467 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:37:11,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 22:37:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:37:11,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:37:11,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:37:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:37:11,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:37:11,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:37:11,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998261775] [2023-02-15 22:37:11,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998261775] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:37:11,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:37:11,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:37:11,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824111498] [2023-02-15 22:37:11,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:37:11,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:37:11,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:37:11,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:37:11,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:37:11,613 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 333 [2023-02-15 22:37:11,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 275 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 22:37:11,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:37:11,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 333 [2023-02-15 22:37:11,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:37:11,778 INFO L130 PetriNetUnfolder]: 73/220 cut-off events. [2023-02-15 22:37:11,778 INFO L131 PetriNetUnfolder]: For 211/211 co-relation queries the response was YES. [2023-02-15 22:37:11,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 220 events. 73/220 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1042 event pairs, 50 based on Foata normal form. 4/149 useless extension candidates. Maximal degree in co-relation 685. Up to 164 conditions per place. [2023-02-15 22:37:11,779 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 47 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-02-15 22:37:11,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 49 transitions, 360 flow [2023-02-15 22:37:11,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:37:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-02-15 22:37:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 604 transitions. [2023-02-15 22:37:11,781 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2023-02-15 22:37:11,781 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 604 transitions. [2023-02-15 22:37:11,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 604 transitions. [2023-02-15 22:37:11,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:37:11,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 604 transitions. [2023-02-15 22:37:11,783 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 22:37:11,784 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 22:37:11,785 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 22:37:11,785 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 275 flow. Second operand 4 states and 604 transitions. [2023-02-15 22:37:11,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 49 transitions, 360 flow [2023-02-15 22:37:11,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 49 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-02-15 22:37:11,787 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 263 flow [2023-02-15 22:37:11,787 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-02-15 22:37:11,787 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2023-02-15 22:37:11,788 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 263 flow [2023-02-15 22:37:11,788 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 22:37:11,788 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:37:11,788 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:37:11,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 22:37:11,999 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 22:37:11,999 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting deleteErr5ASSERT_VIOLATIONMEMORY_FREE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:37:11,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:37:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1960268589, now seen corresponding path program 1 times [2023-02-15 22:37:12,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:37:12,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988528190] [2023-02-15 22:37:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:37:12,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:37:12,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:37:12,001 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 22:37:12,001 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 22:37:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:37:12,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:37:12,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:37:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:37:12,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:37:12,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:37:12,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988528190] [2023-02-15 22:37:12,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988528190] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:37:12,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:37:12,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:37:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084465721] [2023-02-15 22:37:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:37:12,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:37:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:37:12,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:37:12,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:37:12,175 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 333 [2023-02-15 22:37:12,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 263 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 22:37:12,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:37:12,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 333 [2023-02-15 22:37:12,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:37:12,324 INFO L130 PetriNetUnfolder]: 61/184 cut-off events. [2023-02-15 22:37:12,325 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2023-02-15 22:37:12,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 184 events. 61/184 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 781 event pairs, 38 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 603. Up to 128 conditions per place. [2023-02-15 22:37:12,326 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 41 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-02-15 22:37:12,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 43 transitions, 337 flow [2023-02-15 22:37:12,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:37:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-02-15 22:37:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2023-02-15 22:37:12,328 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4527027027027027 [2023-02-15 22:37:12,329 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 603 transitions. [2023-02-15 22:37:12,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 603 transitions. [2023-02-15 22:37:12,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:37:12,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 603 transitions. [2023-02-15 22:37:12,330 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 22:37:12,332 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 22:37:12,332 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 22:37:12,333 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 263 flow. Second operand 4 states and 603 transitions. [2023-02-15 22:37:12,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 43 transitions, 337 flow [2023-02-15 22:37:12,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 43 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-02-15 22:37:12,335 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 252 flow [2023-02-15 22:37:12,335 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-02-15 22:37:12,335 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2023-02-15 22:37:12,336 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 252 flow [2023-02-15 22:37:12,337 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 22:37:12,337 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:37:12,337 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:37:12,356 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 22:37:12,547 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 22:37:12,547 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting deleteErr13ASSERT_VIOLATIONMEMORY_FREE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:37:12,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:37:12,548 INFO L85 PathProgramCache]: Analyzing trace with hash 638781747, now seen corresponding path program 1 times [2023-02-15 22:37:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:37:12,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023811610] [2023-02-15 22:37:12,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:37:12,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:37:12,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:37:12,550 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:37:12,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 22:37:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:37:12,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 22:37:12,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:37:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:37:12,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:37:12,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:37:12,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023811610] [2023-02-15 22:37:12,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023811610] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:37:12,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:37:12,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:37:12,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741694311] [2023-02-15 22:37:12,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:37:12,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:37:12,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:37:12,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:37:12,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:37:12,716 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 333 [2023-02-15 22:37:12,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 252 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 22:37:12,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:37:12,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 333 [2023-02-15 22:37:12,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:37:12,831 INFO L130 PetriNetUnfolder]: 27/94 cut-off events. [2023-02-15 22:37:12,832 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2023-02-15 22:37:12,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 94 events. 27/94 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 258 event pairs, 6 based on Foata normal form. 4/83 useless extension candidates. Maximal degree in co-relation 321. Up to 61 conditions per place. [2023-02-15 22:37:12,832 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 33 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-02-15 22:37:12,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 34 transitions, 257 flow [2023-02-15 22:37:12,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:37:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 22:37:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-02-15 22:37:12,834 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4394394394394394 [2023-02-15 22:37:12,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-02-15 22:37:12,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-02-15 22:37:12,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:37:12,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-02-15 22:37:12,838 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 22:37:12,840 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 22:37:12,841 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 22:37:12,841 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 252 flow. Second operand 3 states and 439 transitions. [2023-02-15 22:37:12,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 34 transitions, 257 flow [2023-02-15 22:37:12,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 34 transitions, 230 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-02-15 22:37:12,842 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 162 flow [2023-02-15 22:37:12,842 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-02-15 22:37:12,843 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -16 predicate places. [2023-02-15 22:37:12,844 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 162 flow [2023-02-15 22:37:12,844 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 22:37:12,844 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:37:12,844 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:37:12,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-15 22:37:13,054 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 22:37:13,055 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting deleteErr12ASSERT_VIOLATIONMEMORY_FREE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:37:13,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:37:13,055 INFO L85 PathProgramCache]: Analyzing trace with hash 638781746, now seen corresponding path program 1 times [2023-02-15 22:37:13,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:37:13,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865557810] [2023-02-15 22:37:13,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:37:13,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:37:13,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:37:13,056 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 22:37:13,057 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 22:37:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:37:13,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 22:37:13,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:37:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:37:13,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:37:13,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:37:13,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865557810] [2023-02-15 22:37:13,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865557810] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:37:13,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:37:13,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:37:13,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444761711] [2023-02-15 22:37:13,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:37:13,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:37:13,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:37:13,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:37:13,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:37:13,223 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 333 [2023-02-15 22:37:13,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 162 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 22:37:13,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:37:13,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 333 [2023-02-15 22:37:13,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:37:13,337 INFO L130 PetriNetUnfolder]: 25/88 cut-off events. [2023-02-15 22:37:13,337 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2023-02-15 22:37:13,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 88 events. 25/88 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 226 event pairs, 6 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 282. Up to 61 conditions per place. [2023-02-15 22:37:13,338 INFO L137 encePairwiseOnDemand]: 331/333 looper letters, 32 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-02-15 22:37:13,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 228 flow [2023-02-15 22:37:13,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:37:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 22:37:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-02-15 22:37:13,340 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4314314314314314 [2023-02-15 22:37:13,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-02-15 22:37:13,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-02-15 22:37:13,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:37:13,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-02-15 22:37:13,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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 22:37:13,342 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 22:37:13,342 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 22:37:13,343 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 162 flow. Second operand 3 states and 431 transitions. [2023-02-15 22:37:13,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 228 flow [2023-02-15 22:37:13,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 33 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-02-15 22:37:13,344 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 161 flow [2023-02-15 22:37:13,344 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=159, 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=161, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-02-15 22:37:13,344 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -16 predicate places. [2023-02-15 22:37:13,344 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 161 flow [2023-02-15 22:37:13,345 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 22:37:13,345 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:37:13,345 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:37:13,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 (18)] Forceful destruction successful, exit code 0 [2023-02-15 22:37:13,555 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 22:37:13,555 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:37:13,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:37:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash 638781655, now seen corresponding path program 1 times [2023-02-15 22:37:13,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:37:13,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344642644] [2023-02-15 22:37:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:37:13,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:37:13,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:37:13,557 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:37:13,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 22:37:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:37:13,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:37:13,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:37:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:37:13,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:37:13,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:37:13,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344642644] [2023-02-15 22:37:13,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344642644] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:37:13,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:37:13,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:37:13,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651252752] [2023-02-15 22:37:13,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:37:13,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:37:13,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:37:13,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:37:13,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:37:13,758 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 333 [2023-02-15 22:37:13,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 161 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 22:37:13,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-02-15 22:37:13,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 333 [2023-02-15 22:37:13,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-02-15 22:37:13,851 INFO L130 PetriNetUnfolder]: 21/76 cut-off events. [2023-02-15 22:37:13,852 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2023-02-15 22:37:13,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 76 events. 21/76 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 6 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 262. Up to 61 conditions per place. [2023-02-15 22:37:13,852 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-02-15 22:37:13,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 31 transitions, 221 flow [2023-02-15 22:37:13,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:37:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-02-15 22:37:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-02-15 22:37:13,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4244244244244244 [2023-02-15 22:37:13,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-02-15 22:37:13,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-02-15 22:37:13,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 22:37:13,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-02-15 22:37:13,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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 22:37:13,857 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 22:37:13,857 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 22:37:13,857 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 161 flow. Second operand 3 states and 424 transitions. [2023-02-15 22:37:13,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 31 transitions, 221 flow [2023-02-15 22:37:13,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 31 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-02-15 22:37:13,859 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 158 flow [2023-02-15 22:37:13,859 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-02-15 22:37:13,859 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -17 predicate places. [2023-02-15 22:37:13,859 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 158 flow [2023-02-15 22:37:13,860 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 22:37:13,860 INFO L201 CegarLoopForPetriNet]: Found error trace [2023-02-15 22:37:13,860 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 22:37:13,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-15 22:37:14,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:37:14,070 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2023-02-15 22:37:14,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:37:14,070 INFO L85 PathProgramCache]: Analyzing trace with hash 227566895, now seen corresponding path program 1 times [2023-02-15 22:37:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:37:14,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982849149] [2023-02-15 22:37:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:37:14,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:37:14,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:37:14,072 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:37:14,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-15 22:37:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:37:14,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:37:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:37:14,394 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 22:37:14,394 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:37:14,395 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (68 of 69 remaining) [2023-02-15 22:37:14,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 69 remaining) [2023-02-15 22:37:14,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 69 remaining) [2023-02-15 22:37:14,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 69 remaining) [2023-02-15 22:37:14,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 69 remaining) [2023-02-15 22:37:14,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 69 remaining) [2023-02-15 22:37:14,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 69 remaining) [2023-02-15 22:37:14,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 69 remaining) [2023-02-15 22:37:14,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 69 remaining) [2023-02-15 22:37:14,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 69 remaining) [2023-02-15 22:37:14,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 69 remaining) [2023-02-15 22:37:14,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 69 remaining) [2023-02-15 22:37:14,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 69 remaining) [2023-02-15 22:37:14,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 69 remaining) [2023-02-15 22:37:14,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 69 remaining) [2023-02-15 22:37:14,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 69 remaining) [2023-02-15 22:37:14,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 69 remaining) [2023-02-15 22:37:14,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 69 remaining) [2023-02-15 22:37:14,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 69 remaining) [2023-02-15 22:37:14,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 69 remaining) [2023-02-15 22:37:14,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 69 remaining) [2023-02-15 22:37:14,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 69 remaining) [2023-02-15 22:37:14,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 69 remaining) [2023-02-15 22:37:14,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 69 remaining) [2023-02-15 22:37:14,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 69 remaining) [2023-02-15 22:37:14,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4ASSERT_VIOLATIONMEMORY_FREE (37 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12ASSERT_VIOLATIONMEMORY_FREE (36 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (35 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13ASSERT_VIOLATIONMEMORY_FREE (34 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (33 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14ASSERT_VIOLATIONMEMORY_FREE (32 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (31 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (30 of 69 remaining) [2023-02-15 22:37:14,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (29 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 69 remaining) [2023-02-15 22:37:14,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 69 remaining) [2023-02-15 22:37:14,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 69 remaining) [2023-02-15 22:37:14,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 69 remaining) [2023-02-15 22:37:14,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 69 remaining) [2023-02-15 22:37:14,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 69 remaining) [2023-02-15 22:37:14,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 69 remaining) [2023-02-15 22:37:14,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4ASSERT_VIOLATIONMEMORY_FREE (8 of 69 remaining) [2023-02-15 22:37:14,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12ASSERT_VIOLATIONMEMORY_FREE (7 of 69 remaining) [2023-02-15 22:37:14,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (6 of 69 remaining) [2023-02-15 22:37:14,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 69 remaining) [2023-02-15 22:37:14,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (4 of 69 remaining) [2023-02-15 22:37:14,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14ASSERT_VIOLATIONMEMORY_FREE (3 of 69 remaining) [2023-02-15 22:37:14,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 69 remaining) [2023-02-15 22:37:14,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (1 of 69 remaining) [2023-02-15 22:37:14,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (0 of 69 remaining) [2023-02-15 22:37:14,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-02-15 22:37:14,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:37:14,609 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:37:14,613 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-02-15 22:37:14,613 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:37:14,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:37:14 BasicIcfg [2023-02-15 22:37:14,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:37:14,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:37:14,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:37:14,660 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:37:14,660 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:34:49" (3/4) ... [2023-02-15 22:37:14,662 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 22:37:14,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:37:14,663 INFO L158 Benchmark]: Toolchain (without parser) took 146356.99ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 52.4MB in the beginning and 59.7MB in the end (delta: -7.3MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2023-02-15 22:37:14,663 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 60.8MB. Free memory was 37.7MB in the beginning and 37.7MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:37:14,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.26ms. Allocated memory is still 77.6MB. Free memory was 52.2MB in the beginning and 40.0MB in the end (delta: 12.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2023-02-15 22:37:14,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.86ms. Allocated memory is still 77.6MB. Free memory was 40.0MB in the beginning and 37.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:37:14,664 INFO L158 Benchmark]: Boogie Preprocessor took 40.98ms. Allocated memory is still 77.6MB. Free memory was 37.4MB in the beginning and 35.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:37:14,664 INFO L158 Benchmark]: RCFGBuilder took 676.12ms. Allocated memory is still 77.6MB. Free memory was 35.3MB in the beginning and 33.4MB in the end (delta: 1.9MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2023-02-15 22:37:14,665 INFO L158 Benchmark]: TraceAbstraction took 144943.71ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 32.5MB in the beginning and 60.6MB in the end (delta: -28.1MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2023-02-15 22:37:14,665 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 94.4MB. Free memory was 60.6MB in the beginning and 59.7MB in the end (delta: 852.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:37:14,666 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 60.8MB. Free memory was 37.7MB in the beginning and 37.7MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.26ms. Allocated memory is still 77.6MB. Free memory was 52.2MB in the beginning and 40.0MB in the end (delta: 12.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.86ms. Allocated memory is still 77.6MB. Free memory was 40.0MB in the beginning and 37.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.98ms. Allocated memory is still 77.6MB. Free memory was 37.4MB in the beginning and 35.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 676.12ms. Allocated memory is still 77.6MB. Free memory was 35.3MB in the beginning and 33.4MB in the end (delta: 1.9MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * TraceAbstraction took 144943.71ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 32.5MB in the beginning and 60.6MB in the end (delta: -28.1MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 94.4MB. Free memory was 60.6MB in the beginning and 59.7MB in the end (delta: 852.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.0s, 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={7:6}, argv={7:6}, id1={-18:0}, id2={-10:0}, list={0:0}, pthread_create(&id1, ((void *)0), build, list)=50331648] [L1048] 1 struct item *list = (struct item *)plist; VAL [list={-2: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={-2:0}, plist={-2: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={-2:0}, plist={-2: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={-2:0}, plist={-2:0}] [L1073] 0 \read(id1) VAL [\old(argc)=5, \read(id1)=50331648, argc=5, argv={7:6}, argv={7:6}, id1={-18:0}, id2={-10: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)=50331648, argc=5, argv={7:6}, argv={7:6}, id1={-18:0}, id2={-10:0}, list={0:0}] [L1074] FCALL, FORK 0 pthread_create(&id2, ((void *)0), delete, list) VAL [\old(argc)=5, argc=5, argv={7:6}, argv={7:6}, id1={-18:0}, id2={-10:0}, list={0:0}, plist={0:0}, pthread_create(&id2, ((void *)0), delete, list)=50331649] [L1075] 0 \read(id2) VAL [\old(argc)=5, \read(id2)=50331649, argc=5, argv={7:6}, argv={7:6}, id1={-18:0}, id2={-10: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)=50331649, \result={0:0}, argc=5, argv={7:6}, argv={7:6}, id1={-18:0}, id2={-10: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: 144.7s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 100.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.1s, HoareTripleCheckerStatistics: 37 mSolverCounterUnknown, 3316 SdHoareTripleChecker+Valid, 91.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2215 mSDsluCounter, 589 SdHoareTripleChecker+Invalid, 89.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 374 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4696 IncrementalHoareTripleChecker+Invalid, 5008 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 215 mSDtfsCounter, 4696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 22.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=12, InterpolantAutomatonStates: 74, 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, 1.0s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 152 ConstructedInterpolants, 13 QuantifiedInterpolants, 1319 SizeOfPredicates, 63 NumberOfNonLiveVariables, 2246 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 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 22:37:14,715 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