./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c -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 f6b55d0b1c42ab7aaefa2efb35454af77e64d43e1c106bfebef7445a043c9409 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 05:29:46,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 05:29:46,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 05:29:46,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 05:29:46,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 05:29:46,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 05:29:46,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 05:29:46,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 05:29:46,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 05:29:46,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 05:29:46,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 05:29:46,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 05:29:46,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 05:29:46,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 05:29:46,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 05:29:46,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 05:29:46,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 05:29:46,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 05:29:46,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 05:29:46,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 05:29:46,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 05:29:46,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 05:29:46,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 05:29:46,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 05:29:46,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 05:29:46,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 05:29:46,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 05:29:46,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 05:29:46,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 05:29:46,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 05:29:46,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 05:29:46,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 05:29:46,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 05:29:46,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 05:29:46,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 05:29:46,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 05:29:46,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 05:29:46,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 05:29:46,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 05:29:46,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 05:29:46,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 05:29:46,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 05:29:46,466 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 05:29:46,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 05:29:46,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 05:29:46,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 05:29:46,468 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 05:29:46,468 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 05:29:46,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 05:29:46,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 05:29:46,469 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 05:29:46,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 05:29:46,470 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 05:29:46,470 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 05:29:46,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 05:29:46,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 05:29:46,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 05:29:46,471 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 05:29:46,471 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 05:29:46,471 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 05:29:46,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 05:29:46,472 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 05:29:46,472 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 05:29:46,472 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 05:29:46,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 05:29:46,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 05:29:46,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 05:29:46,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 05:29:46,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 05:29:46,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 05:29:46,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 05:29:46,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 05:29:46,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 05:29:46,475 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 05:29:46,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 05:29:46,475 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 05:29:46,475 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 -> f6b55d0b1c42ab7aaefa2efb35454af77e64d43e1c106bfebef7445a043c9409 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 05:29:46,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 05:29:46,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 05:29:46,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 05:29:46,835 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 05:29:46,836 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 05:29:46,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2023-08-30 05:29:48,022 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 05:29:48,214 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 05:29:48,215 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2023-08-30 05:29:48,221 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ffe95d2/fdeb781394ef4318b874319039507f6d/FLAG69744e1eb [2023-08-30 05:29:48,234 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ffe95d2/fdeb781394ef4318b874319039507f6d [2023-08-30 05:29:48,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 05:29:48,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 05:29:48,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 05:29:48,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 05:29:48,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 05:29:48,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb71688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48, skipping insertion in model container [2023-08-30 05:29:48,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 05:29:48,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 05:29:48,406 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2023-08-30 05:29:48,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 05:29:48,419 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 05:29:48,445 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2023-08-30 05:29:48,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 05:29:48,453 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 05:29:48,453 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 05:29:48,459 INFO L208 MainTranslator]: Completed translation [2023-08-30 05:29:48,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48 WrapperNode [2023-08-30 05:29:48,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 05:29:48,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 05:29:48,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 05:29:48,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 05:29:48,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,506 INFO L138 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 265 [2023-08-30 05:29:48,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 05:29:48,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 05:29:48,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 05:29:48,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 05:29:48,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,527 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 05:29:48,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 05:29:48,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 05:29:48,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 05:29:48,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48" (1/1) ... [2023-08-30 05:29:48,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 05:29:48,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:29:48,568 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-08-30 05:29:48,587 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-08-30 05:29:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 05:29:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 05:29:48,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 05:29:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 05:29:48,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 05:29:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 05:29:48,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 05:29:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 05:29:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 05:29:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 05:29:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 05:29:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 05:29:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 05:29:48,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 05:29:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 05:29:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 05:29:48,609 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 05:29:48,690 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 05:29:48,691 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 05:29:49,025 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 05:29:49,148 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 05:29:49,148 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 05:29:49,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:29:49 BoogieIcfgContainer [2023-08-30 05:29:49,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 05:29:49,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 05:29:49,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 05:29:49,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 05:29:49,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 05:29:48" (1/3) ... [2023-08-30 05:29:49,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42815481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:29:49, skipping insertion in model container [2023-08-30 05:29:49,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:29:48" (2/3) ... [2023-08-30 05:29:49,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42815481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:29:49, skipping insertion in model container [2023-08-30 05:29:49,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:29:49" (3/3) ... [2023-08-30 05:29:49,157 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2023-08-30 05:29:49,172 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 05:29:49,172 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-30 05:29:49,172 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 05:29:49,278 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-30 05:29:49,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 366 flow [2023-08-30 05:29:49,378 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-30 05:29:49,378 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 05:29:49,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 2/168 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 158 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2023-08-30 05:29:49,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 171 transitions, 366 flow [2023-08-30 05:29:49,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 164 transitions, 346 flow [2023-08-30 05:29:49,390 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 05:29:49,398 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 164 transitions, 346 flow [2023-08-30 05:29:49,402 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 164 transitions, 346 flow [2023-08-30 05:29:49,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 346 flow [2023-08-30 05:29:49,443 INFO L130 PetriNetUnfolder]: 2/164 cut-off events. [2023-08-30 05:29:49,443 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 05:29:49,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 164 events. 2/164 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 157 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2023-08-30 05:29:49,446 INFO L119 LiptonReduction]: Number of co-enabled transitions 2688 [2023-08-30 05:29:54,166 INFO L134 LiptonReduction]: Checked pairs total: 22362 [2023-08-30 05:29:54,166 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-08-30 05:29:54,189 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 05:29:54,196 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;@1542a8f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 05:29:54,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-08-30 05:29:54,198 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 05:29:54,198 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 05:29:54,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:29:54,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 05:29:54,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:29:54,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:29:54,204 INFO L85 PathProgramCache]: Analyzing trace with hash 756, now seen corresponding path program 1 times [2023-08-30 05:29:54,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:29:54,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325232143] [2023-08-30 05:29:54,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:29:54,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:29:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:29:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:29:54,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:29:54,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325232143] [2023-08-30 05:29:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325232143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:29:54,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:29:54,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 05:29:54,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850445399] [2023-08-30 05:29:54,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:29:54,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 05:29:54,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:29:54,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 05:29:54,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 05:29:54,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 297 [2023-08-30 05:29:54,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 142 flow. Second operand has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 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-08-30 05:29:54,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:29:54,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 297 [2023-08-30 05:29:54,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:29:55,122 INFO L130 PetriNetUnfolder]: 3906/6589 cut-off events. [2023-08-30 05:29:55,123 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2023-08-30 05:29:55,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12494 conditions, 6589 events. 3906/6589 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 45651 event pairs, 3906 based on Foata normal form. 0/5401 useless extension candidates. Maximal degree in co-relation 11254. Up to 5730 conditions per place. [2023-08-30 05:29:55,186 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 41 selfloop transitions, 0 changer transitions 0/59 dead transitions. [2023-08-30 05:29:55,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 218 flow [2023-08-30 05:29:55,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 05:29:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 05:29:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 338 transitions. [2023-08-30 05:29:55,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.569023569023569 [2023-08-30 05:29:55,206 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 338 transitions. [2023-08-30 05:29:55,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 338 transitions. [2023-08-30 05:29:55,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:29:55,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 338 transitions. [2023-08-30 05:29:55,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 169.0) internal successors, (338), 2 states have internal predecessors, (338), 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-08-30 05:29:55,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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-08-30 05:29:55,221 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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-08-30 05:29:55,222 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 142 flow. Second operand 2 states and 338 transitions. [2023-08-30 05:29:55,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 218 flow [2023-08-30 05:29:55,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 206 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 05:29:55,235 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 124 flow [2023-08-30 05:29:55,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2023-08-30 05:29:55,240 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-08-30 05:29:55,240 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 124 flow [2023-08-30 05:29:55,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 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-08-30 05:29:55,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:29:55,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 05:29:55,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 05:29:55,244 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:29:55,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:29:55,245 INFO L85 PathProgramCache]: Analyzing trace with hash 744639, now seen corresponding path program 1 times [2023-08-30 05:29:55,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:29:55,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347231235] [2023-08-30 05:29:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:29:55,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:29:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:29:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:29:55,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:29:55,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347231235] [2023-08-30 05:29:55,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347231235] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:29:55,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:29:55,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 05:29:55,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760197062] [2023-08-30 05:29:55,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:29:55,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:29:55,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:29:55,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:29:55,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:29:55,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 297 [2023-08-30 05:29:55,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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-08-30 05:29:55,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:29:55,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 297 [2023-08-30 05:29:55,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:29:56,161 INFO L130 PetriNetUnfolder]: 3816/6441 cut-off events. [2023-08-30 05:29:56,161 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-30 05:29:56,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12084 conditions, 6441 events. 3816/6441 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 44550 event pairs, 3816 based on Foata normal form. 0/5311 useless extension candidates. Maximal degree in co-relation 12081. Up to 5583 conditions per place. [2023-08-30 05:29:56,194 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 38 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-08-30 05:29:56,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 198 flow [2023-08-30 05:29:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:29:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:29:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-08-30 05:29:56,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072951739618407 [2023-08-30 05:29:56,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-08-30 05:29:56,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-08-30 05:29:56,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:29:56,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-08-30 05:29:56,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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-08-30 05:29:56,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:29:56,203 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:29:56,203 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 124 flow. Second operand 3 states and 452 transitions. [2023-08-30 05:29:56,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 198 flow [2023-08-30 05:29:56,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 05:29:56,205 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 122 flow [2023-08-30 05:29:56,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2023-08-30 05:29:56,206 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-08-30 05:29:56,207 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 122 flow [2023-08-30 05:29:56,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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-08-30 05:29:56,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:29:56,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 05:29:56,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 05:29:56,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:29:56,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:29:56,208 INFO L85 PathProgramCache]: Analyzing trace with hash 744640, now seen corresponding path program 1 times [2023-08-30 05:29:56,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:29:56,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846070364] [2023-08-30 05:29:56,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:29:56,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:29:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:29:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:29:56,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:29:56,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846070364] [2023-08-30 05:29:56,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846070364] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:29:56,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:29:56,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 05:29:56,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133711058] [2023-08-30 05:29:56,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:29:56,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:29:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:29:56,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:29:56,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:29:56,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 297 [2023-08-30 05:29:56,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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-08-30 05:29:56,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:29:56,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 297 [2023-08-30 05:29:56,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:29:56,848 INFO L130 PetriNetUnfolder]: 3726/6293 cut-off events. [2023-08-30 05:29:56,849 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-30 05:29:56,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11792 conditions, 6293 events. 3726/6293 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 43431 event pairs, 3726 based on Foata normal form. 0/5221 useless extension candidates. Maximal degree in co-relation 11788. Up to 5437 conditions per place. [2023-08-30 05:29:56,880 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 36 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-08-30 05:29:56,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 192 flow [2023-08-30 05:29:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:29:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:29:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-08-30 05:29:56,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218855218855218 [2023-08-30 05:29:56,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-08-30 05:29:56,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-08-30 05:29:56,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:29:56,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-08-30 05:29:56,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-08-30 05:29:56,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:29:56,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:29:56,888 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 122 flow. Second operand 3 states and 465 transitions. [2023-08-30 05:29:56,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 192 flow [2023-08-30 05:29:56,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 55 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:29:56,889 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 119 flow [2023-08-30 05:29:56,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-08-30 05:29:56,890 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-08-30 05:29:56,891 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 119 flow [2023-08-30 05:29:56,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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-08-30 05:29:56,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:29:56,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 05:29:56,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 05:29:56,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:29:56,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:29:56,892 INFO L85 PathProgramCache]: Analyzing trace with hash 715619205, now seen corresponding path program 1 times [2023-08-30 05:29:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:29:56,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140170484] [2023-08-30 05:29:56,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:29:56,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:29:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:29:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:29:56,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:29:56,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140170484] [2023-08-30 05:29:56,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140170484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:29:56,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:29:56,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 05:29:56,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398916394] [2023-08-30 05:29:56,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:29:56,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:29:56,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:29:56,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:29:56,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:29:57,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 297 [2023-08-30 05:29:57,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 119 flow. Second operand has 3 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-08-30 05:29:57,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:29:57,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 297 [2023-08-30 05:29:57,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:29:57,479 INFO L130 PetriNetUnfolder]: 3636/6125 cut-off events. [2023-08-30 05:29:57,480 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-30 05:29:57,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11479 conditions, 6125 events. 3636/6125 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 42220 event pairs, 3636 based on Foata normal form. 0/5120 useless extension candidates. Maximal degree in co-relation 11475. Up to 5291 conditions per place. [2023-08-30 05:29:57,509 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 34 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-30 05:29:57,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 185 flow [2023-08-30 05:29:57,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:29:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:29:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-08-30 05:29:57,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196408529741863 [2023-08-30 05:29:57,512 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-08-30 05:29:57,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-08-30 05:29:57,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:29:57,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-08-30 05:29:57,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-08-30 05:29:57,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:29:57,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:29:57,516 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 119 flow. Second operand 3 states and 463 transitions. [2023-08-30 05:29:57,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 185 flow [2023-08-30 05:29:57,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:29:57,517 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 116 flow [2023-08-30 05:29:57,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2023-08-30 05:29:57,518 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-08-30 05:29:57,519 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 116 flow [2023-08-30 05:29:57,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-08-30 05:29:57,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:29:57,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 05:29:57,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 05:29:57,520 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:29:57,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:29:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash 715619204, now seen corresponding path program 1 times [2023-08-30 05:29:57,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:29:57,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168059110] [2023-08-30 05:29:57,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:29:57,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:29:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:29:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:29:57,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:29:57,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168059110] [2023-08-30 05:29:57,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168059110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:29:57,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:29:57,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 05:29:57,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636569797] [2023-08-30 05:29:57,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:29:57,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:29:57,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:29:57,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:29:57,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:29:57,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 297 [2023-08-30 05:29:57,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 116 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-08-30 05:29:57,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:29:57,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 297 [2023-08-30 05:29:57,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:29:58,093 INFO L130 PetriNetUnfolder]: 3546/5957 cut-off events. [2023-08-30 05:29:58,093 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-30 05:29:58,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11166 conditions, 5957 events. 3546/5957 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 40740 event pairs, 3546 based on Foata normal form. 0/5019 useless extension candidates. Maximal degree in co-relation 11162. Up to 5145 conditions per place. [2023-08-30 05:29:58,122 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 32 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-08-30 05:29:58,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 178 flow [2023-08-30 05:29:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:29:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:29:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-30 05:29:58,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500561167227834 [2023-08-30 05:29:58,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-30 05:29:58,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-30 05:29:58,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:29:58,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-30 05:29:58,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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-08-30 05:29:58,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:29:58,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:29:58,128 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 116 flow. Second operand 3 states and 446 transitions. [2023-08-30 05:29:58,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 178 flow [2023-08-30 05:29:58,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 51 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:29:58,130 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 113 flow [2023-08-30 05:29:58,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-08-30 05:29:58,131 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-30 05:29:58,131 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 113 flow [2023-08-30 05:29:58,131 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-08-30 05:29:58,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:29:58,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:29:58,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 05:29:58,132 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:29:58,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:29:58,132 INFO L85 PathProgramCache]: Analyzing trace with hash 515305849, now seen corresponding path program 1 times [2023-08-30 05:29:58,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:29:58,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068019357] [2023-08-30 05:29:58,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:29:58,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:29:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:29:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:29:58,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:29:58,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068019357] [2023-08-30 05:29:58,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068019357] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:29:58,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:29:58,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 05:29:58,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635254685] [2023-08-30 05:29:58,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:29:58,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 05:29:58,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:29:58,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 05:29:58,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 05:29:58,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 297 [2023-08-30 05:29:58,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 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-08-30 05:29:58,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:29:58,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 297 [2023-08-30 05:29:58,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:29:58,668 INFO L130 PetriNetUnfolder]: 2664/4554 cut-off events. [2023-08-30 05:29:58,668 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-30 05:29:58,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8539 conditions, 4554 events. 2664/4554 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 30375 event pairs, 2664 based on Foata normal form. 0/4018 useless extension candidates. Maximal degree in co-relation 8535. Up to 3920 conditions per place. [2023-08-30 05:29:58,697 INFO L137 encePairwiseOnDemand]: 295/297 looper letters, 31 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2023-08-30 05:29:58,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 175 flow [2023-08-30 05:29:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:29:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:29:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-30 05:29:58,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713804713804714 [2023-08-30 05:29:58,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-30 05:29:58,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-30 05:29:58,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:29:58,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-30 05:29:58,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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-08-30 05:29:58,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:29:58,703 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:29:58,703 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 113 flow. Second operand 3 states and 420 transitions. [2023-08-30 05:29:58,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 175 flow [2023-08-30 05:29:58,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 50 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:29:58,705 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-08-30 05:29:58,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-08-30 05:29:58,706 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-30 05:29:58,706 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-08-30 05:29:58,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 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-08-30 05:29:58,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:29:58,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:29:58,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 05:29:58,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:29:58,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:29:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash 515305850, now seen corresponding path program 1 times [2023-08-30 05:29:58,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:29:58,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638040877] [2023-08-30 05:29:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:29:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:29:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:29:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:29:58,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:29:58,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638040877] [2023-08-30 05:29:58,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638040877] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:29:58,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:29:58,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 05:29:58,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379914448] [2023-08-30 05:29:58,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:29:58,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:29:58,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:29:58,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:29:58,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:29:58,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 297 [2023-08-30 05:29:58,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-08-30 05:29:58,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:29:58,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 297 [2023-08-30 05:29:58,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:29:59,134 INFO L130 PetriNetUnfolder]: 1782/3151 cut-off events. [2023-08-30 05:29:59,135 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-30 05:29:59,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5912 conditions, 3151 events. 1782/3151 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 20223 event pairs, 1782 based on Foata normal form. 0/3017 useless extension candidates. Maximal degree in co-relation 5908. Up to 2695 conditions per place. [2023-08-30 05:29:59,150 INFO L137 encePairwiseOnDemand]: 295/297 looper letters, 30 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-08-30 05:29:59,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 49 transitions, 172 flow [2023-08-30 05:29:59,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:29:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:29:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-30 05:29:59,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140291806958474 [2023-08-30 05:29:59,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-30 05:29:59,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-30 05:29:59,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:29:59,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-30 05:29:59,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-08-30 05:29:59,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:29:59,157 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:29:59,157 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 458 transitions. [2023-08-30 05:29:59,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 49 transitions, 172 flow [2023-08-30 05:29:59,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:29:59,158 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 111 flow [2023-08-30 05:29:59,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-08-30 05:29:59,159 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-30 05:29:59,160 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 111 flow [2023-08-30 05:29:59,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-08-30 05:29:59,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:29:59,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:29:59,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 05:29:59,161 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:29:59,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:29:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1851685884, now seen corresponding path program 1 times [2023-08-30 05:29:59,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:29:59,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320724657] [2023-08-30 05:29:59,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:29:59,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:29:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:29:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:29:59,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:29:59,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320724657] [2023-08-30 05:29:59,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320724657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:29:59,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:29:59,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:29:59,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422023638] [2023-08-30 05:29:59,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:29:59,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 05:29:59,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:29:59,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 05:29:59,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:29:59,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:29:59,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 111 flow. Second operand has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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-08-30 05:29:59,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:29:59,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:29:59,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:00,570 INFO L130 PetriNetUnfolder]: 4870/7530 cut-off events. [2023-08-30 05:30:00,570 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-30 05:30:00,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15125 conditions, 7530 events. 4870/7530 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 44660 event pairs, 1571 based on Foata normal form. 1/7463 useless extension candidates. Maximal degree in co-relation 15121. Up to 2087 conditions per place. [2023-08-30 05:30:00,603 INFO L137 encePairwiseOnDemand]: 289/297 looper letters, 157 selfloop transitions, 15 changer transitions 25/209 dead transitions. [2023-08-30 05:30:00,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 209 transitions, 851 flow [2023-08-30 05:30:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 05:30:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 05:30:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1661 transitions. [2023-08-30 05:30:00,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084175084175084 [2023-08-30 05:30:00,608 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1661 transitions. [2023-08-30 05:30:00,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1661 transitions. [2023-08-30 05:30:00,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:00,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1661 transitions. [2023-08-30 05:30:00,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 151.0) internal successors, (1661), 11 states have internal predecessors, (1661), 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-08-30 05:30:00,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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-08-30 05:30:00,617 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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-08-30 05:30:00,617 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 111 flow. Second operand 11 states and 1661 transitions. [2023-08-30 05:30:00,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 209 transitions, 851 flow [2023-08-30 05:30:00,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 209 transitions, 850 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:30:00,620 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 202 flow [2023-08-30 05:30:00,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=202, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2023-08-30 05:30:00,621 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2023-08-30 05:30:00,621 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 202 flow [2023-08-30 05:30:00,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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-08-30 05:30:00,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:00,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:00,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 05:30:00,622 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:00,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash -954322370, now seen corresponding path program 2 times [2023-08-30 05:30:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:00,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503072522] [2023-08-30 05:30:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:00,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:01,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:01,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503072522] [2023-08-30 05:30:01,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503072522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:01,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:01,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 05:30:01,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091553873] [2023-08-30 05:30:01,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:01,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 05:30:01,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:01,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 05:30:01,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:30:01,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:30:01,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 202 flow. Second operand has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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-08-30 05:30:01,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:01,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:30:01,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:02,214 INFO L130 PetriNetUnfolder]: 4848/8600 cut-off events. [2023-08-30 05:30:02,214 INFO L131 PetriNetUnfolder]: For 223/225 co-relation queries the response was YES. [2023-08-30 05:30:02,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17256 conditions, 8600 events. 4848/8600 cut-off events. For 223/225 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 61600 event pairs, 423 based on Foata normal form. 104/8580 useless extension candidates. Maximal degree in co-relation 17248. Up to 4518 conditions per place. [2023-08-30 05:30:02,254 INFO L137 encePairwiseOnDemand]: 287/297 looper letters, 114 selfloop transitions, 18 changer transitions 0/161 dead transitions. [2023-08-30 05:30:02,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 161 transitions, 669 flow [2023-08-30 05:30:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 05:30:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 05:30:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1332 transitions. [2023-08-30 05:30:02,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2023-08-30 05:30:02,258 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1332 transitions. [2023-08-30 05:30:02,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1332 transitions. [2023-08-30 05:30:02,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:02,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1332 transitions. [2023-08-30 05:30:02,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 148.0) internal successors, (1332), 9 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-08-30 05:30:02,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:30:02,265 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:30:02,265 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 202 flow. Second operand 9 states and 1332 transitions. [2023-08-30 05:30:02,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 161 transitions, 669 flow [2023-08-30 05:30:02,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 161 transitions, 665 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 05:30:02,271 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 313 flow [2023-08-30 05:30:02,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=313, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2023-08-30 05:30:02,271 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 14 predicate places. [2023-08-30 05:30:02,272 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 313 flow [2023-08-30 05:30:02,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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-08-30 05:30:02,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:02,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:02,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 05:30:02,273 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:02,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:02,273 INFO L85 PathProgramCache]: Analyzing trace with hash 40937618, now seen corresponding path program 3 times [2023-08-30 05:30:02,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:02,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940622748] [2023-08-30 05:30:02,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:02,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:02,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:02,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940622748] [2023-08-30 05:30:02,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940622748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:02,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:02,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 05:30:02,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396720303] [2023-08-30 05:30:02,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:02,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:30:02,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:02,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:30:02,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:30:02,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 297 [2023-08-30 05:30:02,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-08-30 05:30:02,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:02,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 297 [2023-08-30 05:30:02,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:03,030 INFO L130 PetriNetUnfolder]: 3834/7344 cut-off events. [2023-08-30 05:30:03,031 INFO L131 PetriNetUnfolder]: For 3876/3990 co-relation queries the response was YES. [2023-08-30 05:30:03,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17192 conditions, 7344 events. 3834/7344 cut-off events. For 3876/3990 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 55082 event pairs, 2857 based on Foata normal form. 100/7154 useless extension candidates. Maximal degree in co-relation 17177. Up to 5237 conditions per place. [2023-08-30 05:30:03,080 INFO L137 encePairwiseOnDemand]: 293/297 looper letters, 56 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2023-08-30 05:30:03,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 96 transitions, 478 flow [2023-08-30 05:30:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:30:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:30:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-08-30 05:30:03,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375982042648709 [2023-08-30 05:30:03,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-08-30 05:30:03,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-08-30 05:30:03,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:03,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-08-30 05:30:03,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-08-30 05:30:03,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:30:03,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:30:03,087 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 313 flow. Second operand 3 states and 479 transitions. [2023-08-30 05:30:03,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 96 transitions, 478 flow [2023-08-30 05:30:03,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 96 transitions, 478 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 05:30:03,104 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 323 flow [2023-08-30 05:30:03,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2023-08-30 05:30:03,105 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 17 predicate places. [2023-08-30 05:30:03,106 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 323 flow [2023-08-30 05:30:03,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-08-30 05:30:03,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:03,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:03,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 05:30:03,107 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:03,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash 466293516, now seen corresponding path program 4 times [2023-08-30 05:30:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:03,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332620965] [2023-08-30 05:30:03,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:03,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:03,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332620965] [2023-08-30 05:30:03,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332620965] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:03,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:03,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 05:30:03,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075894555] [2023-08-30 05:30:03,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:03,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 05:30:03,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:03,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 05:30:03,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:30:03,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-30 05:30:03,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 323 flow. Second operand has 9 states, 9 states have (on average 136.11111111111111) internal successors, (1225), 9 states have internal predecessors, (1225), 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-08-30 05:30:03,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:03,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-30 05:30:03,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:04,811 INFO L130 PetriNetUnfolder]: 7739/13885 cut-off events. [2023-08-30 05:30:04,811 INFO L131 PetriNetUnfolder]: For 7098/7250 co-relation queries the response was YES. [2023-08-30 05:30:04,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33915 conditions, 13885 events. 7739/13885 cut-off events. For 7098/7250 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 104688 event pairs, 2488 based on Foata normal form. 146/13830 useless extension candidates. Maximal degree in co-relation 33898. Up to 8163 conditions per place. [2023-08-30 05:30:04,901 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 140 selfloop transitions, 36 changer transitions 2/206 dead transitions. [2023-08-30 05:30:04,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 206 transitions, 1075 flow [2023-08-30 05:30:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 05:30:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 05:30:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1347 transitions. [2023-08-30 05:30:04,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5039281705948373 [2023-08-30 05:30:04,905 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1347 transitions. [2023-08-30 05:30:04,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1347 transitions. [2023-08-30 05:30:04,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:04,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1347 transitions. [2023-08-30 05:30:04,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.66666666666666) internal successors, (1347), 9 states have internal predecessors, (1347), 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-08-30 05:30:04,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:30:04,913 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:30:04,914 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 323 flow. Second operand 9 states and 1347 transitions. [2023-08-30 05:30:04,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 206 transitions, 1075 flow [2023-08-30 05:30:04,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 206 transitions, 1071 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 05:30:04,941 INFO L231 Difference]: Finished difference. Result has 102 places, 117 transitions, 632 flow [2023-08-30 05:30:04,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=632, PETRI_PLACES=102, PETRI_TRANSITIONS=117} [2023-08-30 05:30:04,942 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 30 predicate places. [2023-08-30 05:30:04,942 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 117 transitions, 632 flow [2023-08-30 05:30:04,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 136.11111111111111) internal successors, (1225), 9 states have internal predecessors, (1225), 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-08-30 05:30:04,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:04,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:04,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 05:30:04,943 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:04,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:04,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1452945116, now seen corresponding path program 5 times [2023-08-30 05:30:04,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:04,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761797246] [2023-08-30 05:30:04,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:04,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:05,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761797246] [2023-08-30 05:30:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761797246] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:05,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:05,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:30:05,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547626353] [2023-08-30 05:30:05,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:05,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 05:30:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:05,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 05:30:05,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:30:05,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:30:05,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 117 transitions, 632 flow. Second operand has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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-08-30 05:30:05,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:05,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:30:05,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:06,129 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 174#L139true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,129 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 05:30:06,130 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 05:30:06,130 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 05:30:06,130 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 05:30:06,247 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 25#L146true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,247 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 05:30:06,248 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 05:30:06,248 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 05:30:06,248 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 05:30:06,250 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 174#L139true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,250 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 05:30:06,251 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 05:30:06,251 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 05:30:06,251 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 05:30:06,251 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 25#L146true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,252 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,252 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,252 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,252 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,363 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 153#L149true, 239#true, 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,364 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,364 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,364 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,364 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,365 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 25#L146true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,365 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,365 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,365 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,365 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,365 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 05:30:06,367 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 25#L146true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,368 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,368 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,368 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,368 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,403 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 153#L149true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,404 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,404 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,404 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,404 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,472 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 27#L152true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,473 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,473 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,473 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,473 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,473 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 153#L149true, 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,473 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,473 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,474 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,474 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,474 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,474 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 25#L146true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,474 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,474 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,474 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,474 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,474 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 05:30:06,507 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 153#L149true, 167#L192-1true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,508 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,508 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,508 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,508 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,509 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 27#L152true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,509 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,509 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,509 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,509 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,570 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 57#L155true, 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,570 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,570 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,570 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,570 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,571 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 27#L152true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,571 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,571 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,571 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,571 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,571 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,572 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 153#L149true, 239#true, 167#L192-1true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,572 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,572 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,572 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,572 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,572 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 05:30:06,603 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 27#L152true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,603 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,603 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,603 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,603 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,604 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 57#L155true, 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,604 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,604 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,604 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,604 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,665 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 57#L155true, 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,665 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,665 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,665 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,665 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,665 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,666 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][185], [Black: 258#(= ~e1~0 1), 292#(and (<= 1 ~i~0) (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 149#L159true, Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,666 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,666 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,666 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,667 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,667 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 27#L152true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,668 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,668 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,668 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,668 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,668 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 05:30:06,698 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 57#L155true, 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,698 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,698 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,698 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,698 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,699 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][185], [Black: 258#(= ~e1~0 1), 292#(and (<= 1 ~i~0) (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0) (<= ~i~0 1)), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 149#L159true, Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,699 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,699 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,699 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,700 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,776 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 57#L155true, 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,776 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,776 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,776 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,776 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,777 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,777 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][185], [Black: 258#(= ~e1~0 1), 292#(and (<= 1 ~i~0) (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0) (<= ~i~0 1)), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 149#L159true, Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,777 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,777 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,777 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,777 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,777 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,777 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][196], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), 156#L162true, Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,778 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,778 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,778 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,778 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,778 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L162-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= v_~n3~0_53 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, ~n3~0=v_~n3~0_53, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, ~n3~0, thread3Thread1of1ForFork1_#res#1.base][198], [114#thread3EXITtrue, Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), 117#L93true, Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 241#(= ~n3~0 0), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,778 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,778 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,778 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,778 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 05:30:06,779 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L162-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= v_~n3~0_53 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, ~n3~0=v_~n3~0_53, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, ~n3~0, thread3Thread1of1ForFork1_#res#1.base][198], [114#thread3EXITtrue, Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), 117#L93true, Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 241#(= ~n3~0 0), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,780 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,780 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,780 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,780 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,801 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][185], [Black: 258#(= ~e1~0 1), 292#(and (<= 1 ~i~0) (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 149#L159true, Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,801 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,801 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,801 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,801 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,802 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][196], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), 156#L162true, Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,802 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,802 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,802 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,802 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,872 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][185], [Black: 258#(= ~e1~0 1), 292#(and (<= 1 ~i~0) (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 149#L159true, Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,872 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,872 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,872 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,873 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,873 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,873 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][196], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), 156#L162true, Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,873 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,873 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,874 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,874 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,874 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,874 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([668] L162-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= v_~n3~0_53 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, ~n3~0=v_~n3~0_53, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, ~n3~0, thread3Thread1of1ForFork1_#res#1.base][198], [114#thread3EXITtrue, Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), 117#L93true, Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 241#(= ~n3~0 0), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,874 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,874 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,874 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,875 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,875 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 05:30:06,876 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L162-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= v_~n3~0_53 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, ~n3~0=v_~n3~0_53, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, ~n3~0, thread3Thread1of1ForFork1_#res#1.base][198], [114#thread3EXITtrue, Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), 117#L93true, Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 241#(= ~n3~0 0), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,876 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,876 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,876 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,876 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,899 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][196], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), 156#L162true, Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,900 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,900 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,900 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,900 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,964 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][196], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), 156#L162true, Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,964 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,964 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,964 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,965 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,965 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,965 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([668] L162-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= v_~n3~0_53 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, ~n3~0=v_~n3~0_53, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, ~n3~0, thread3Thread1of1ForFork1_#res#1.base][198], [114#thread3EXITtrue, Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), 117#L93true, Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 241#(= ~n3~0 0), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-08-30 05:30:06,965 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,965 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,965 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,965 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:06,966 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 05:30:07,459 INFO L130 PetriNetUnfolder]: 10885/17775 cut-off events. [2023-08-30 05:30:07,460 INFO L131 PetriNetUnfolder]: For 20796/21515 co-relation queries the response was YES. [2023-08-30 05:30:07,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53162 conditions, 17775 events. 10885/17775 cut-off events. For 20796/21515 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 124870 event pairs, 3956 based on Foata normal form. 294/17516 useless extension candidates. Maximal degree in co-relation 53138. Up to 4721 conditions per place. [2023-08-30 05:30:07,592 INFO L137 encePairwiseOnDemand]: 289/297 looper letters, 235 selfloop transitions, 21 changer transitions 34/323 dead transitions. [2023-08-30 05:30:07,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 323 transitions, 2158 flow [2023-08-30 05:30:07,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 05:30:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 05:30:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1657 transitions. [2023-08-30 05:30:07,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071931435567799 [2023-08-30 05:30:07,597 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1657 transitions. [2023-08-30 05:30:07,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1657 transitions. [2023-08-30 05:30:07,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:07,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1657 transitions. [2023-08-30 05:30:07,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 150.63636363636363) internal successors, (1657), 11 states have internal predecessors, (1657), 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-08-30 05:30:07,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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-08-30 05:30:07,607 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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-08-30 05:30:07,607 INFO L175 Difference]: Start difference. First operand has 102 places, 117 transitions, 632 flow. Second operand 11 states and 1657 transitions. [2023-08-30 05:30:07,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 323 transitions, 2158 flow [2023-08-30 05:30:07,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 323 transitions, 2112 flow, removed 23 selfloop flow, removed 0 redundant places. [2023-08-30 05:30:07,722 INFO L231 Difference]: Finished difference. Result has 117 places, 126 transitions, 730 flow [2023-08-30 05:30:07,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=730, PETRI_PLACES=117, PETRI_TRANSITIONS=126} [2023-08-30 05:30:07,724 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 45 predicate places. [2023-08-30 05:30:07,724 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 126 transitions, 730 flow [2023-08-30 05:30:07,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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-08-30 05:30:07,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:07,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:07,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 05:30:07,725 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:07,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:07,726 INFO L85 PathProgramCache]: Analyzing trace with hash 790282874, now seen corresponding path program 6 times [2023-08-30 05:30:07,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:07,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710642482] [2023-08-30 05:30:07,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:07,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710642482] [2023-08-30 05:30:07,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710642482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:07,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:07,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 05:30:07,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552666059] [2023-08-30 05:30:07,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:07,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:30:07,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:07,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:30:07,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:30:07,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 297 [2023-08-30 05:30:07,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 126 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-08-30 05:30:07,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:07,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 297 [2023-08-30 05:30:07,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:08,874 INFO L130 PetriNetUnfolder]: 6770/12920 cut-off events. [2023-08-30 05:30:08,875 INFO L131 PetriNetUnfolder]: For 17034/17651 co-relation queries the response was YES. [2023-08-30 05:30:08,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37662 conditions, 12920 events. 6770/12920 cut-off events. For 17034/17651 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 104058 event pairs, 4513 based on Foata normal form. 282/12558 useless extension candidates. Maximal degree in co-relation 37632. Up to 8836 conditions per place. [2023-08-30 05:30:08,964 INFO L137 encePairwiseOnDemand]: 293/297 looper letters, 96 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2023-08-30 05:30:08,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 160 transitions, 1113 flow [2023-08-30 05:30:08,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:30:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:30:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-08-30 05:30:08,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375982042648709 [2023-08-30 05:30:08,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-08-30 05:30:08,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-08-30 05:30:08,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:08,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-08-30 05:30:08,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-08-30 05:30:08,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:30:08,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:30:08,970 INFO L175 Difference]: Start difference. First operand has 117 places, 126 transitions, 730 flow. Second operand 3 states and 479 transitions. [2023-08-30 05:30:08,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 160 transitions, 1113 flow [2023-08-30 05:30:09,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 160 transitions, 1096 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-30 05:30:09,050 INFO L231 Difference]: Finished difference. Result has 113 places, 126 transitions, 723 flow [2023-08-30 05:30:09,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=113, PETRI_TRANSITIONS=126} [2023-08-30 05:30:09,051 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 41 predicate places. [2023-08-30 05:30:09,051 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 126 transitions, 723 flow [2023-08-30 05:30:09,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-08-30 05:30:09,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:09,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:09,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 05:30:09,052 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:09,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash -158141900, now seen corresponding path program 7 times [2023-08-30 05:30:09,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:09,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689000954] [2023-08-30 05:30:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:09,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:09,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:09,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689000954] [2023-08-30 05:30:09,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689000954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:09,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:09,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:30:09,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132315932] [2023-08-30 05:30:09,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:09,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 05:30:09,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:09,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 05:30:09,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 05:30:09,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-30 05:30:09,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 126 transitions, 723 flow. Second operand has 8 states, 8 states have (on average 136.625) internal successors, (1093), 8 states have internal predecessors, (1093), 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-08-30 05:30:09,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:09,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-30 05:30:09,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:11,214 INFO L130 PetriNetUnfolder]: 9578/17477 cut-off events. [2023-08-30 05:30:11,214 INFO L131 PetriNetUnfolder]: For 22147/22664 co-relation queries the response was YES. [2023-08-30 05:30:11,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52557 conditions, 17477 events. 9578/17477 cut-off events. For 22147/22664 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 138366 event pairs, 3733 based on Foata normal form. 272/17434 useless extension candidates. Maximal degree in co-relation 52528. Up to 9263 conditions per place. [2023-08-30 05:30:11,321 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 142 selfloop transitions, 45 changer transitions 0/224 dead transitions. [2023-08-30 05:30:11,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 224 transitions, 1499 flow [2023-08-30 05:30:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 05:30:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 05:30:11,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1205 transitions. [2023-08-30 05:30:11,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071548821548821 [2023-08-30 05:30:11,325 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1205 transitions. [2023-08-30 05:30:11,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1205 transitions. [2023-08-30 05:30:11,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:11,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1205 transitions. [2023-08-30 05:30:11,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 150.625) internal successors, (1205), 8 states have internal predecessors, (1205), 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-08-30 05:30:11,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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-08-30 05:30:11,332 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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-08-30 05:30:11,332 INFO L175 Difference]: Start difference. First operand has 113 places, 126 transitions, 723 flow. Second operand 8 states and 1205 transitions. [2023-08-30 05:30:11,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 224 transitions, 1499 flow [2023-08-30 05:30:11,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 224 transitions, 1495 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 05:30:11,422 INFO L231 Difference]: Finished difference. Result has 122 places, 140 transitions, 973 flow [2023-08-30 05:30:11,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=973, PETRI_PLACES=122, PETRI_TRANSITIONS=140} [2023-08-30 05:30:11,423 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 50 predicate places. [2023-08-30 05:30:11,423 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 140 transitions, 973 flow [2023-08-30 05:30:11,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 136.625) internal successors, (1093), 8 states have internal predecessors, (1093), 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-08-30 05:30:11,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:11,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:11,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 05:30:11,424 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:11,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1903921250, now seen corresponding path program 8 times [2023-08-30 05:30:11,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:11,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594903763] [2023-08-30 05:30:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:11,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:11,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594903763] [2023-08-30 05:30:11,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594903763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:11,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:11,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 05:30:11,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379887388] [2023-08-30 05:30:11,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:11,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:30:11,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:11,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:30:11,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:30:11,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:30:11,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 140 transitions, 973 flow. Second operand has 7 states, 7 states have (on average 138.14285714285714) internal successors, (967), 7 states have internal predecessors, (967), 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-08-30 05:30:11,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:11,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:30:11,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:13,617 INFO L130 PetriNetUnfolder]: 10061/18211 cut-off events. [2023-08-30 05:30:13,618 INFO L131 PetriNetUnfolder]: For 37976/38844 co-relation queries the response was YES. [2023-08-30 05:30:13,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59147 conditions, 18211 events. 10061/18211 cut-off events. For 37976/38844 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 145005 event pairs, 4915 based on Foata normal form. 332/18029 useless extension candidates. Maximal degree in co-relation 59114. Up to 13317 conditions per place. [2023-08-30 05:30:13,722 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 135 selfloop transitions, 31 changer transitions 0/206 dead transitions. [2023-08-30 05:30:13,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 206 transitions, 1607 flow [2023-08-30 05:30:13,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 05:30:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 05:30:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1045 transitions. [2023-08-30 05:30:13,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026455026455027 [2023-08-30 05:30:13,726 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1045 transitions. [2023-08-30 05:30:13,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1045 transitions. [2023-08-30 05:30:13,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:13,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1045 transitions. [2023-08-30 05:30:13,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 149.28571428571428) internal successors, (1045), 7 states have internal predecessors, (1045), 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-08-30 05:30:13,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 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-08-30 05:30:13,732 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 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-08-30 05:30:13,732 INFO L175 Difference]: Start difference. First operand has 122 places, 140 transitions, 973 flow. Second operand 7 states and 1045 transitions. [2023-08-30 05:30:13,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 206 transitions, 1607 flow [2023-08-30 05:30:13,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 206 transitions, 1547 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-30 05:30:13,882 INFO L231 Difference]: Finished difference. Result has 129 places, 153 transitions, 1164 flow [2023-08-30 05:30:13,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1164, PETRI_PLACES=129, PETRI_TRANSITIONS=153} [2023-08-30 05:30:13,882 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 57 predicate places. [2023-08-30 05:30:13,882 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 153 transitions, 1164 flow [2023-08-30 05:30:13,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 138.14285714285714) internal successors, (967), 7 states have internal predecessors, (967), 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-08-30 05:30:13,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:13,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:13,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 05:30:13,883 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:13,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2062195802, now seen corresponding path program 9 times [2023-08-30 05:30:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840488874] [2023-08-30 05:30:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:14,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:14,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840488874] [2023-08-30 05:30:14,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840488874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:14,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:14,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 05:30:14,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897853963] [2023-08-30 05:30:14,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:14,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:30:14,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:14,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:30:14,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:30:14,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:30:14,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 153 transitions, 1164 flow. Second operand has 7 states, 7 states have (on average 138.14285714285714) internal successors, (967), 7 states have internal predecessors, (967), 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-08-30 05:30:14,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:14,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:30:14,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:16,261 INFO L130 PetriNetUnfolder]: 11000/20023 cut-off events. [2023-08-30 05:30:16,261 INFO L131 PetriNetUnfolder]: For 49028/50172 co-relation queries the response was YES. [2023-08-30 05:30:16,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68035 conditions, 20023 events. 11000/20023 cut-off events. For 49028/50172 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 162034 event pairs, 5009 based on Foata normal form. 398/19882 useless extension candidates. Maximal degree in co-relation 67998. Up to 15179 conditions per place. [2023-08-30 05:30:16,402 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 155 selfloop transitions, 37 changer transitions 0/236 dead transitions. [2023-08-30 05:30:16,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 236 transitions, 2015 flow [2023-08-30 05:30:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 05:30:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 05:30:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1044 transitions. [2023-08-30 05:30:16,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021645021645021 [2023-08-30 05:30:16,405 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1044 transitions. [2023-08-30 05:30:16,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1044 transitions. [2023-08-30 05:30:16,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:16,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1044 transitions. [2023-08-30 05:30:16,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 149.14285714285714) internal successors, (1044), 7 states have internal predecessors, (1044), 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-08-30 05:30:16,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 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-08-30 05:30:16,411 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 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-08-30 05:30:16,411 INFO L175 Difference]: Start difference. First operand has 129 places, 153 transitions, 1164 flow. Second operand 7 states and 1044 transitions. [2023-08-30 05:30:16,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 236 transitions, 2015 flow [2023-08-30 05:30:16,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 236 transitions, 1983 flow, removed 16 selfloop flow, removed 0 redundant places. [2023-08-30 05:30:16,631 INFO L231 Difference]: Finished difference. Result has 140 places, 184 transitions, 1580 flow [2023-08-30 05:30:16,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1580, PETRI_PLACES=140, PETRI_TRANSITIONS=184} [2023-08-30 05:30:16,632 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 68 predicate places. [2023-08-30 05:30:16,632 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 184 transitions, 1580 flow [2023-08-30 05:30:16,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 138.14285714285714) internal successors, (967), 7 states have internal predecessors, (967), 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-08-30 05:30:16,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:16,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:16,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 05:30:16,633 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:16,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:16,634 INFO L85 PathProgramCache]: Analyzing trace with hash 261740224, now seen corresponding path program 10 times [2023-08-30 05:30:16,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:16,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266542887] [2023-08-30 05:30:16,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:16,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266542887] [2023-08-30 05:30:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266542887] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 05:30:16,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497029329] [2023-08-30 05:30:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:16,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:30:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:16,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:30:16,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:30:16,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 297 [2023-08-30 05:30:16,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 184 transitions, 1580 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-08-30 05:30:16,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:16,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 297 [2023-08-30 05:30:16,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:18,528 INFO L130 PetriNetUnfolder]: 9682/18109 cut-off events. [2023-08-30 05:30:18,528 INFO L131 PetriNetUnfolder]: For 59966/61640 co-relation queries the response was YES. [2023-08-30 05:30:18,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64912 conditions, 18109 events. 9682/18109 cut-off events. For 59966/61640 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 150111 event pairs, 6551 based on Foata normal form. 596/17885 useless extension candidates. Maximal degree in co-relation 64869. Up to 12453 conditions per place. [2023-08-30 05:30:18,665 INFO L137 encePairwiseOnDemand]: 293/297 looper letters, 147 selfloop transitions, 2 changer transitions 1/228 dead transitions. [2023-08-30 05:30:18,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 228 transitions, 2242 flow [2023-08-30 05:30:18,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:30:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:30:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-08-30 05:30:18,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375982042648709 [2023-08-30 05:30:18,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-08-30 05:30:18,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-08-30 05:30:18,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:18,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-08-30 05:30:18,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-08-30 05:30:18,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:30:18,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-08-30 05:30:18,670 INFO L175 Difference]: Start difference. First operand has 140 places, 184 transitions, 1580 flow. Second operand 3 states and 479 transitions. [2023-08-30 05:30:18,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 228 transitions, 2242 flow [2023-08-30 05:30:18,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 228 transitions, 2168 flow, removed 37 selfloop flow, removed 0 redundant places. [2023-08-30 05:30:18,889 INFO L231 Difference]: Finished difference. Result has 143 places, 181 transitions, 1493 flow [2023-08-30 05:30:18,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1493, PETRI_PLACES=143, PETRI_TRANSITIONS=181} [2023-08-30 05:30:18,889 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 71 predicate places. [2023-08-30 05:30:18,889 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 181 transitions, 1493 flow [2023-08-30 05:30:18,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-08-30 05:30:18,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:18,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:18,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 05:30:18,890 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:18,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1778272718, now seen corresponding path program 11 times [2023-08-30 05:30:18,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:18,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593654440] [2023-08-30 05:30:18,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:18,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:19,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:19,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593654440] [2023-08-30 05:30:19,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593654440] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:19,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:19,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 05:30:19,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4148234] [2023-08-30 05:30:19,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:19,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 05:30:19,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:19,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 05:30:19,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:30:19,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:30:19,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 181 transitions, 1493 flow. Second operand has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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-08-30 05:30:19,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:19,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:30:19,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:21,747 INFO L130 PetriNetUnfolder]: 12990/24156 cut-off events. [2023-08-30 05:30:21,747 INFO L131 PetriNetUnfolder]: For 74618/76037 co-relation queries the response was YES. [2023-08-30 05:30:21,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87999 conditions, 24156 events. 12990/24156 cut-off events. For 74618/76037 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 207370 event pairs, 5219 based on Foata normal form. 266/23969 useless extension candidates. Maximal degree in co-relation 87954. Up to 14167 conditions per place. [2023-08-30 05:30:21,985 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 188 selfloop transitions, 58 changer transitions 11/308 dead transitions. [2023-08-30 05:30:21,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 308 transitions, 2759 flow [2023-08-30 05:30:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 05:30:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 05:30:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1342 transitions. [2023-08-30 05:30:21,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020576131687243 [2023-08-30 05:30:21,989 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1342 transitions. [2023-08-30 05:30:21,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1342 transitions. [2023-08-30 05:30:21,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:21,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1342 transitions. [2023-08-30 05:30:21,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.11111111111111) internal successors, (1342), 9 states have internal predecessors, (1342), 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-08-30 05:30:21,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:30:21,994 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:30:21,994 INFO L175 Difference]: Start difference. First operand has 143 places, 181 transitions, 1493 flow. Second operand 9 states and 1342 transitions. [2023-08-30 05:30:21,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 308 transitions, 2759 flow [2023-08-30 05:30:22,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 308 transitions, 2755 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 05:30:22,249 INFO L231 Difference]: Finished difference. Result has 155 places, 219 transitions, 2066 flow [2023-08-30 05:30:22,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2066, PETRI_PLACES=155, PETRI_TRANSITIONS=219} [2023-08-30 05:30:22,250 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 83 predicate places. [2023-08-30 05:30:22,250 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 219 transitions, 2066 flow [2023-08-30 05:30:22,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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-08-30 05:30:22,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:22,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:22,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 05:30:22,251 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:22,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash -279244148, now seen corresponding path program 12 times [2023-08-30 05:30:22,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:22,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568337533] [2023-08-30 05:30:22,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:22,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:22,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:22,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568337533] [2023-08-30 05:30:22,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568337533] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:22,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:22,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 05:30:22,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533828889] [2023-08-30 05:30:22,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:22,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 05:30:22,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:22,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 05:30:22,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:30:22,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-30 05:30:22,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 219 transitions, 2066 flow. Second operand has 9 states, 9 states have (on average 136.11111111111111) internal successors, (1225), 9 states have internal predecessors, (1225), 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-08-30 05:30:22,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:22,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-30 05:30:22,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:25,785 INFO L130 PetriNetUnfolder]: 15865/29258 cut-off events. [2023-08-30 05:30:25,785 INFO L131 PetriNetUnfolder]: For 117945/119327 co-relation queries the response was YES. [2023-08-30 05:30:26,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114912 conditions, 29258 events. 15865/29258 cut-off events. For 117945/119327 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 253832 event pairs, 6407 based on Foata normal form. 650/29482 useless extension candidates. Maximal degree in co-relation 114861. Up to 17612 conditions per place. [2023-08-30 05:30:26,106 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 240 selfloop transitions, 90 changer transitions 1/368 dead transitions. [2023-08-30 05:30:26,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 368 transitions, 3750 flow [2023-08-30 05:30:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 05:30:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 05:30:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1634 transitions. [2023-08-30 05:30:26,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5001530456075911 [2023-08-30 05:30:26,110 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1634 transitions. [2023-08-30 05:30:26,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1634 transitions. [2023-08-30 05:30:26,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:26,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1634 transitions. [2023-08-30 05:30:26,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 148.54545454545453) internal successors, (1634), 11 states have internal predecessors, (1634), 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-08-30 05:30:26,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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-08-30 05:30:26,117 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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-08-30 05:30:26,117 INFO L175 Difference]: Start difference. First operand has 155 places, 219 transitions, 2066 flow. Second operand 11 states and 1634 transitions. [2023-08-30 05:30:26,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 368 transitions, 3750 flow [2023-08-30 05:30:26,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 368 transitions, 3608 flow, removed 71 selfloop flow, removed 0 redundant places. [2023-08-30 05:30:26,563 INFO L231 Difference]: Finished difference. Result has 174 places, 263 transitions, 2830 flow [2023-08-30 05:30:26,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2830, PETRI_PLACES=174, PETRI_TRANSITIONS=263} [2023-08-30 05:30:26,563 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 102 predicate places. [2023-08-30 05:30:26,564 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 263 transitions, 2830 flow [2023-08-30 05:30:26,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 136.11111111111111) internal successors, (1225), 9 states have internal predecessors, (1225), 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-08-30 05:30:26,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:26,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:26,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 05:30:26,564 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:26,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1227370186, now seen corresponding path program 13 times [2023-08-30 05:30:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:26,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980035742] [2023-08-30 05:30:26,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:26,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:27,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:27,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980035742] [2023-08-30 05:30:27,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980035742] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:27,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:27,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 05:30:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143266220] [2023-08-30 05:30:27,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:27,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 05:30:27,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:27,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 05:30:27,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-30 05:30:27,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-08-30 05:30:27,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 263 transitions, 2830 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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-08-30 05:30:27,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:27,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-08-30 05:30:27,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:31,398 INFO L130 PetriNetUnfolder]: 14729/27266 cut-off events. [2023-08-30 05:30:31,398 INFO L131 PetriNetUnfolder]: For 154713/157847 co-relation queries the response was YES. [2023-08-30 05:30:31,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116811 conditions, 27266 events. 14729/27266 cut-off events. For 154713/157847 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 237448 event pairs, 6975 based on Foata normal form. 424/26703 useless extension candidates. Maximal degree in co-relation 116750. Up to 21259 conditions per place. [2023-08-30 05:30:31,577 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 230 selfloop transitions, 37 changer transitions 22/363 dead transitions. [2023-08-30 05:30:31,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 363 transitions, 4060 flow [2023-08-30 05:30:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 05:30:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 05:30:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1353 transitions. [2023-08-30 05:30:31,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2023-08-30 05:30:31,580 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1353 transitions. [2023-08-30 05:30:31,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1353 transitions. [2023-08-30 05:30:31,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:31,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1353 transitions. [2023-08-30 05:30:31,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 150.33333333333334) internal successors, (1353), 9 states have internal predecessors, (1353), 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-08-30 05:30:31,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:30:31,585 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:30:31,585 INFO L175 Difference]: Start difference. First operand has 174 places, 263 transitions, 2830 flow. Second operand 9 states and 1353 transitions. [2023-08-30 05:30:31,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 363 transitions, 4060 flow [2023-08-30 05:30:32,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 363 transitions, 3838 flow, removed 111 selfloop flow, removed 0 redundant places. [2023-08-30 05:30:32,274 INFO L231 Difference]: Finished difference. Result has 187 places, 280 transitions, 2982 flow [2023-08-30 05:30:32,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=2656, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2982, PETRI_PLACES=187, PETRI_TRANSITIONS=280} [2023-08-30 05:30:32,275 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 115 predicate places. [2023-08-30 05:30:32,275 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 280 transitions, 2982 flow [2023-08-30 05:30:32,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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-08-30 05:30:32,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:32,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:32,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 05:30:32,276 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:32,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:32,276 INFO L85 PathProgramCache]: Analyzing trace with hash 889321604, now seen corresponding path program 14 times [2023-08-30 05:30:32,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:32,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683824591] [2023-08-30 05:30:32,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:32,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:32,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:32,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683824591] [2023-08-30 05:30:32,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683824591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:32,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:32,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 05:30:32,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397891912] [2023-08-30 05:30:32,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:32,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 05:30:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:32,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 05:30:32,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:30:32,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-08-30 05:30:32,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 280 transitions, 2982 flow. Second operand has 9 states, 9 states have (on average 138.88888888888889) internal successors, (1250), 9 states have internal predecessors, (1250), 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-08-30 05:30:32,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:32,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-08-30 05:30:32,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:37,755 INFO L130 PetriNetUnfolder]: 18263/34098 cut-off events. [2023-08-30 05:30:37,756 INFO L131 PetriNetUnfolder]: For 206591/210256 co-relation queries the response was YES. [2023-08-30 05:30:37,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146060 conditions, 34098 events. 18263/34098 cut-off events. For 206591/210256 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 308201 event pairs, 7321 based on Foata normal form. 920/34133 useless extension candidates. Maximal degree in co-relation 145993. Up to 14419 conditions per place. [2023-08-30 05:30:38,068 INFO L137 encePairwiseOnDemand]: 288/297 looper letters, 249 selfloop transitions, 81 changer transitions 17/417 dead transitions. [2023-08-30 05:30:38,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 417 transitions, 4700 flow [2023-08-30 05:30:38,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 05:30:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 05:30:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1365 transitions. [2023-08-30 05:30:38,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510662177328844 [2023-08-30 05:30:38,071 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1365 transitions. [2023-08-30 05:30:38,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1365 transitions. [2023-08-30 05:30:38,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:38,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1365 transitions. [2023-08-30 05:30:38,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 151.66666666666666) internal successors, (1365), 9 states have internal predecessors, (1365), 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-08-30 05:30:38,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:30:38,076 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:30:38,076 INFO L175 Difference]: Start difference. First operand has 187 places, 280 transitions, 2982 flow. Second operand 9 states and 1365 transitions. [2023-08-30 05:30:38,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 417 transitions, 4700 flow [2023-08-30 05:30:38,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 417 transitions, 4667 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-08-30 05:30:38,981 INFO L231 Difference]: Finished difference. Result has 198 places, 300 transitions, 3490 flow [2023-08-30 05:30:38,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=2949, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3490, PETRI_PLACES=198, PETRI_TRANSITIONS=300} [2023-08-30 05:30:38,982 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 126 predicate places. [2023-08-30 05:30:38,982 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 300 transitions, 3490 flow [2023-08-30 05:30:38,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 138.88888888888889) internal successors, (1250), 9 states have internal predecessors, (1250), 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-08-30 05:30:38,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:38,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:38,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 05:30:38,983 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:38,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1343915178, now seen corresponding path program 15 times [2023-08-30 05:30:38,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:38,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799400489] [2023-08-30 05:30:38,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:38,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:39,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:39,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799400489] [2023-08-30 05:30:39,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799400489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:39,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:39,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:30:39,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929069023] [2023-08-30 05:30:39,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:39,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 05:30:39,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:39,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 05:30:39,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 05:30:39,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-08-30 05:30:39,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 300 transitions, 3490 flow. Second operand has 8 states, 8 states have (on average 139.375) internal successors, (1115), 8 states have internal predecessors, (1115), 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-08-30 05:30:39,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:39,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-08-30 05:30:39,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:44,730 INFO L130 PetriNetUnfolder]: 18820/34830 cut-off events. [2023-08-30 05:30:44,731 INFO L131 PetriNetUnfolder]: For 243816/247302 co-relation queries the response was YES. [2023-08-30 05:30:44,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155551 conditions, 34830 events. 18820/34830 cut-off events. For 243816/247302 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 312409 event pairs, 8708 based on Foata normal form. 558/34178 useless extension candidates. Maximal degree in co-relation 155478. Up to 24303 conditions per place. [2023-08-30 05:30:45,083 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 243 selfloop transitions, 50 changer transitions 16/390 dead transitions. [2023-08-30 05:30:45,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 390 transitions, 4729 flow [2023-08-30 05:30:45,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 05:30:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 05:30:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1209 transitions. [2023-08-30 05:30:45,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5088383838383839 [2023-08-30 05:30:45,085 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1209 transitions. [2023-08-30 05:30:45,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1209 transitions. [2023-08-30 05:30:45,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:45,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1209 transitions. [2023-08-30 05:30:45,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 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-08-30 05:30:45,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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-08-30 05:30:45,090 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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-08-30 05:30:45,090 INFO L175 Difference]: Start difference. First operand has 198 places, 300 transitions, 3490 flow. Second operand 8 states and 1209 transitions. [2023-08-30 05:30:45,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 390 transitions, 4729 flow [2023-08-30 05:30:46,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 390 transitions, 4623 flow, removed 41 selfloop flow, removed 3 redundant places. [2023-08-30 05:30:46,230 INFO L231 Difference]: Finished difference. Result has 203 places, 308 transitions, 3693 flow [2023-08-30 05:30:46,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=3392, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3693, PETRI_PLACES=203, PETRI_TRANSITIONS=308} [2023-08-30 05:30:46,231 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 131 predicate places. [2023-08-30 05:30:46,231 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 308 transitions, 3693 flow [2023-08-30 05:30:46,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 139.375) internal successors, (1115), 8 states have internal predecessors, (1115), 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-08-30 05:30:46,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:46,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:46,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 05:30:46,232 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:46,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:46,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1577385606, now seen corresponding path program 16 times [2023-08-30 05:30:46,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:46,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156536325] [2023-08-30 05:30:46,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:46,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:46,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:46,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156536325] [2023-08-30 05:30:46,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156536325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:46,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:46,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:30:46,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588577954] [2023-08-30 05:30:46,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:46,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 05:30:46,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:46,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 05:30:46,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 05:30:46,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:30:46,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 308 transitions, 3693 flow. Second operand has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 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-08-30 05:30:46,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:46,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:30:46,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:30:52,571 INFO L130 PetriNetUnfolder]: 21830/39533 cut-off events. [2023-08-30 05:30:52,571 INFO L131 PetriNetUnfolder]: For 288579/291719 co-relation queries the response was YES. [2023-08-30 05:30:53,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180160 conditions, 39533 events. 21830/39533 cut-off events. For 288579/291719 co-relation queries the response was YES. Maximal size of possible extension queue 1129. Compared 347922 event pairs, 8839 based on Foata normal form. 744/39042 useless extension candidates. Maximal degree in co-relation 180085. Up to 23400 conditions per place. [2023-08-30 05:30:53,196 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 310 selfloop transitions, 128 changer transitions 10/493 dead transitions. [2023-08-30 05:30:53,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 493 transitions, 6350 flow [2023-08-30 05:30:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 05:30:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 05:30:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1501 transitions. [2023-08-30 05:30:53,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053872053872054 [2023-08-30 05:30:53,198 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1501 transitions. [2023-08-30 05:30:53,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1501 transitions. [2023-08-30 05:30:53,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:30:53,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1501 transitions. [2023-08-30 05:30:53,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 150.1) internal successors, (1501), 10 states have internal predecessors, (1501), 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-08-30 05:30:53,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-08-30 05:30:53,204 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-08-30 05:30:53,204 INFO L175 Difference]: Start difference. First operand has 203 places, 308 transitions, 3693 flow. Second operand 10 states and 1501 transitions. [2023-08-30 05:30:53,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 493 transitions, 6350 flow [2023-08-30 05:30:54,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 493 transitions, 6234 flow, removed 30 selfloop flow, removed 3 redundant places. [2023-08-30 05:30:54,555 INFO L231 Difference]: Finished difference. Result has 217 places, 357 transitions, 4871 flow [2023-08-30 05:30:54,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=3620, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4871, PETRI_PLACES=217, PETRI_TRANSITIONS=357} [2023-08-30 05:30:54,556 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 145 predicate places. [2023-08-30 05:30:54,556 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 357 transitions, 4871 flow [2023-08-30 05:30:54,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 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-08-30 05:30:54,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:30:54,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:30:54,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 05:30:54,556 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:30:54,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:30:54,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1056183076, now seen corresponding path program 17 times [2023-08-30 05:30:54,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:30:54,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139433468] [2023-08-30 05:30:54,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:30:54,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:30:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:30:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:30:55,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:30:55,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139433468] [2023-08-30 05:30:55,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139433468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:30:55,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:30:55,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 05:30:55,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929140394] [2023-08-30 05:30:55,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:30:55,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 05:30:55,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:30:55,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 05:30:55,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-08-30 05:30:55,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-30 05:30:55,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 357 transitions, 4871 flow. Second operand has 10 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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-08-30 05:30:55,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:30:55,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-30 05:30:55,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:31:03,462 INFO L130 PetriNetUnfolder]: 24810/47361 cut-off events. [2023-08-30 05:31:03,463 INFO L131 PetriNetUnfolder]: For 418607/422204 co-relation queries the response was YES. [2023-08-30 05:31:03,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222676 conditions, 47361 events. 24810/47361 cut-off events. For 418607/422204 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 453102 event pairs, 9825 based on Foata normal form. 1122/47733 useless extension candidates. Maximal degree in co-relation 222593. Up to 26238 conditions per place. [2023-08-30 05:31:04,034 INFO L137 encePairwiseOnDemand]: 282/297 looper letters, 470 selfloop transitions, 156 changer transitions 4/667 dead transitions. [2023-08-30 05:31:04,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 667 transitions, 9147 flow [2023-08-30 05:31:04,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 05:31:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 05:31:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2929 transitions. [2023-08-30 05:31:04,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930976430976431 [2023-08-30 05:31:04,038 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2929 transitions. [2023-08-30 05:31:04,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2929 transitions. [2023-08-30 05:31:04,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:31:04,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2929 transitions. [2023-08-30 05:31:04,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 146.45) internal successors, (2929), 20 states have internal predecessors, (2929), 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-08-30 05:31:04,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 297.0) internal successors, (6237), 21 states have internal predecessors, (6237), 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-08-30 05:31:04,045 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 297.0) internal successors, (6237), 21 states have internal predecessors, (6237), 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-08-30 05:31:04,045 INFO L175 Difference]: Start difference. First operand has 217 places, 357 transitions, 4871 flow. Second operand 20 states and 2929 transitions. [2023-08-30 05:31:04,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 667 transitions, 9147 flow [2023-08-30 05:31:07,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 667 transitions, 8740 flow, removed 197 selfloop flow, removed 2 redundant places. [2023-08-30 05:31:07,515 INFO L231 Difference]: Finished difference. Result has 249 places, 443 transitions, 6586 flow [2023-08-30 05:31:07,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=4653, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6586, PETRI_PLACES=249, PETRI_TRANSITIONS=443} [2023-08-30 05:31:07,516 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 177 predicate places. [2023-08-30 05:31:07,516 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 443 transitions, 6586 flow [2023-08-30 05:31:07,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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-08-30 05:31:07,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:31:07,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:31:07,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 05:31:07,517 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:31:07,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:31:07,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1567269094, now seen corresponding path program 18 times [2023-08-30 05:31:07,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:31:07,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757246461] [2023-08-30 05:31:07,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:31:07,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:31:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:31:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:31:07,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:31:07,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757246461] [2023-08-30 05:31:07,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757246461] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:31:07,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:31:07,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 05:31:07,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344815145] [2023-08-30 05:31:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:31:07,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:31:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:31:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:31:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:31:07,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-08-30 05:31:07,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 443 transitions, 6586 flow. Second operand has 7 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 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-08-30 05:31:07,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:31:07,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-08-30 05:31:07,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:31:16,111 INFO L130 PetriNetUnfolder]: 22748/42882 cut-off events. [2023-08-30 05:31:16,111 INFO L131 PetriNetUnfolder]: For 498031/500847 co-relation queries the response was YES. [2023-08-30 05:31:16,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219398 conditions, 42882 events. 22748/42882 cut-off events. For 498031/500847 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 398404 event pairs, 11263 based on Foata normal form. 542/42607 useless extension candidates. Maximal degree in co-relation 219301. Up to 32103 conditions per place. [2023-08-30 05:31:16,695 INFO L137 encePairwiseOnDemand]: 287/297 looper letters, 410 selfloop transitions, 59 changer transitions 4/510 dead transitions. [2023-08-30 05:31:16,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 510 transitions, 7984 flow [2023-08-30 05:31:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 05:31:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 05:31:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1196 transitions. [2023-08-30 05:31:16,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033670033670034 [2023-08-30 05:31:16,697 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1196 transitions. [2023-08-30 05:31:16,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1196 transitions. [2023-08-30 05:31:16,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:31:16,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1196 transitions. [2023-08-30 05:31:16,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 149.5) internal successors, (1196), 8 states have internal predecessors, (1196), 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-08-30 05:31:16,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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-08-30 05:31:16,700 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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-08-30 05:31:16,700 INFO L175 Difference]: Start difference. First operand has 249 places, 443 transitions, 6586 flow. Second operand 8 states and 1196 transitions. [2023-08-30 05:31:16,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 510 transitions, 7984 flow [2023-08-30 05:31:20,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 510 transitions, 7730 flow, removed 127 selfloop flow, removed 2 redundant places. [2023-08-30 05:31:20,008 INFO L231 Difference]: Finished difference. Result has 253 places, 430 transitions, 6279 flow [2023-08-30 05:31:20,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6007, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6279, PETRI_PLACES=253, PETRI_TRANSITIONS=430} [2023-08-30 05:31:20,009 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 181 predicate places. [2023-08-30 05:31:20,009 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 430 transitions, 6279 flow [2023-08-30 05:31:20,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 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-08-30 05:31:20,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:31:20,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:31:20,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 05:31:20,010 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:31:20,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:31:20,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1428394696, now seen corresponding path program 19 times [2023-08-30 05:31:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:31:20,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742260722] [2023-08-30 05:31:20,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:31:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:31:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:31:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:31:20,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:31:20,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742260722] [2023-08-30 05:31:20,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742260722] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:31:20,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:31:20,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 05:31:20,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693367546] [2023-08-30 05:31:20,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:31:20,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 05:31:20,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:31:20,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 05:31:20,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:31:20,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-08-30 05:31:20,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 430 transitions, 6279 flow. Second operand has 9 states, 9 states have (on average 137.88888888888889) internal successors, (1241), 9 states have internal predecessors, (1241), 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-08-30 05:31:20,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:31:20,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-08-30 05:31:20,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:31:29,052 INFO L130 PetriNetUnfolder]: 23517/43854 cut-off events. [2023-08-30 05:31:29,052 INFO L131 PetriNetUnfolder]: For 495832/499818 co-relation queries the response was YES. [2023-08-30 05:31:29,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224494 conditions, 43854 events. 23517/43854 cut-off events. For 495832/499818 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 408057 event pairs, 10444 based on Foata normal form. 458/43016 useless extension candidates. Maximal degree in co-relation 224396. Up to 33184 conditions per place. [2023-08-30 05:31:29,888 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 388 selfloop transitions, 52 changer transitions 23/528 dead transitions. [2023-08-30 05:31:29,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 528 transitions, 8113 flow [2023-08-30 05:31:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 05:31:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 05:31:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1346 transitions. [2023-08-30 05:31:29,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035540591096147 [2023-08-30 05:31:29,890 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1346 transitions. [2023-08-30 05:31:29,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1346 transitions. [2023-08-30 05:31:29,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:31:29,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1346 transitions. [2023-08-30 05:31:29,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.55555555555554) internal successors, (1346), 9 states have internal predecessors, (1346), 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-08-30 05:31:29,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:31:29,894 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:31:29,894 INFO L175 Difference]: Start difference. First operand has 253 places, 430 transitions, 6279 flow. Second operand 9 states and 1346 transitions. [2023-08-30 05:31:29,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 528 transitions, 8113 flow [2023-08-30 05:31:32,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 528 transitions, 8034 flow, removed 33 selfloop flow, removed 1 redundant places. [2023-08-30 05:31:32,766 INFO L231 Difference]: Finished difference. Result has 263 places, 429 transitions, 6364 flow [2023-08-30 05:31:32,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6216, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6364, PETRI_PLACES=263, PETRI_TRANSITIONS=429} [2023-08-30 05:31:32,767 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 191 predicate places. [2023-08-30 05:31:32,767 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 429 transitions, 6364 flow [2023-08-30 05:31:32,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.88888888888889) internal successors, (1241), 9 states have internal predecessors, (1241), 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-08-30 05:31:32,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:31:32,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:31:32,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-30 05:31:32,768 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:31:32,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:31:32,768 INFO L85 PathProgramCache]: Analyzing trace with hash -572934070, now seen corresponding path program 20 times [2023-08-30 05:31:32,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:31:32,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353350065] [2023-08-30 05:31:32,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:31:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:31:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:31:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:31:33,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:31:33,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353350065] [2023-08-30 05:31:33,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353350065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:31:33,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:31:33,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 05:31:33,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748971935] [2023-08-30 05:31:33,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:31:33,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 05:31:33,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:31:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 05:31:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-08-30 05:31:33,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:31:33,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 429 transitions, 6364 flow. Second operand has 10 states, 10 states have (on average 136.6) internal successors, (1366), 10 states have internal predecessors, (1366), 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-08-30 05:31:33,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:31:33,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:31:33,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:31:42,191 INFO L130 PetriNetUnfolder]: 23678/45028 cut-off events. [2023-08-30 05:31:42,191 INFO L131 PetriNetUnfolder]: For 527474/530750 co-relation queries the response was YES. [2023-08-30 05:31:42,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232766 conditions, 45028 events. 23678/45028 cut-off events. For 527474/530750 co-relation queries the response was YES. Maximal size of possible extension queue 1299. Compared 428562 event pairs, 12163 based on Foata normal form. 216/44312 useless extension candidates. Maximal degree in co-relation 232664. Up to 36611 conditions per place. [2023-08-30 05:31:42,809 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 377 selfloop transitions, 28 changer transitions 34/496 dead transitions. [2023-08-30 05:31:42,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 496 transitions, 7716 flow [2023-08-30 05:31:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 05:31:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 05:31:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1455 transitions. [2023-08-30 05:31:42,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2023-08-30 05:31:42,811 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1455 transitions. [2023-08-30 05:31:42,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1455 transitions. [2023-08-30 05:31:42,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:31:42,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1455 transitions. [2023-08-30 05:31:42,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 145.5) internal successors, (1455), 10 states have internal predecessors, (1455), 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-08-30 05:31:42,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-08-30 05:31:42,816 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-08-30 05:31:42,816 INFO L175 Difference]: Start difference. First operand has 263 places, 429 transitions, 6364 flow. Second operand 10 states and 1455 transitions. [2023-08-30 05:31:42,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 496 transitions, 7716 flow [2023-08-30 05:31:46,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 496 transitions, 7601 flow, removed 33 selfloop flow, removed 4 redundant places. [2023-08-30 05:31:46,277 INFO L231 Difference]: Finished difference. Result has 271 places, 425 transitions, 6258 flow [2023-08-30 05:31:46,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6268, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6258, PETRI_PLACES=271, PETRI_TRANSITIONS=425} [2023-08-30 05:31:46,278 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 199 predicate places. [2023-08-30 05:31:46,278 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 425 transitions, 6258 flow [2023-08-30 05:31:46,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 136.6) internal successors, (1366), 10 states have internal predecessors, (1366), 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-08-30 05:31:46,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:31:46,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:31:46,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-30 05:31:46,279 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:31:46,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:31:46,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1815263710, now seen corresponding path program 21 times [2023-08-30 05:31:46,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:31:46,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120075854] [2023-08-30 05:31:46,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:31:46,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:31:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:31:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:31:46,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:31:46,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120075854] [2023-08-30 05:31:46,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120075854] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:31:46,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:31:46,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 05:31:46,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528651359] [2023-08-30 05:31:46,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:31:46,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 05:31:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:31:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 05:31:46,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-08-30 05:31:46,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-08-30 05:31:46,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 425 transitions, 6258 flow. Second operand has 10 states, 10 states have (on average 137.5) internal successors, (1375), 10 states have internal predecessors, (1375), 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-08-30 05:31:46,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:31:46,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-08-30 05:31:46,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:31:56,012 INFO L130 PetriNetUnfolder]: 23901/45508 cut-off events. [2023-08-30 05:31:56,012 INFO L131 PetriNetUnfolder]: For 549403/553377 co-relation queries the response was YES. [2023-08-30 05:31:56,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235076 conditions, 45508 events. 23901/45508 cut-off events. For 549403/553377 co-relation queries the response was YES. Maximal size of possible extension queue 1348. Compared 435981 event pairs, 12032 based on Foata normal form. 416/44877 useless extension candidates. Maximal degree in co-relation 234971. Up to 35081 conditions per place. [2023-08-30 05:31:56,641 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 385 selfloop transitions, 29 changer transitions 47/526 dead transitions. [2023-08-30 05:31:56,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 526 transitions, 8127 flow [2023-08-30 05:31:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 05:31:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 05:31:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1348 transitions. [2023-08-30 05:31:56,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043022820800599 [2023-08-30 05:31:56,643 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1348 transitions. [2023-08-30 05:31:56,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1348 transitions. [2023-08-30 05:31:56,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:31:56,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1348 transitions. [2023-08-30 05:31:56,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.77777777777777) internal successors, (1348), 9 states have internal predecessors, (1348), 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-08-30 05:31:56,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:31:56,646 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:31:56,646 INFO L175 Difference]: Start difference. First operand has 271 places, 425 transitions, 6258 flow. Second operand 9 states and 1348 transitions. [2023-08-30 05:31:56,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 526 transitions, 8127 flow [2023-08-30 05:31:59,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 526 transitions, 8050 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-08-30 05:31:59,848 INFO L231 Difference]: Finished difference. Result has 275 places, 427 transitions, 6376 flow [2023-08-30 05:31:59,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6191, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6376, PETRI_PLACES=275, PETRI_TRANSITIONS=427} [2023-08-30 05:31:59,849 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 203 predicate places. [2023-08-30 05:31:59,849 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 427 transitions, 6376 flow [2023-08-30 05:31:59,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 137.5) internal successors, (1375), 10 states have internal predecessors, (1375), 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-08-30 05:31:59,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:31:59,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:31:59,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-30 05:31:59,850 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:31:59,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:31:59,851 INFO L85 PathProgramCache]: Analyzing trace with hash -358898564, now seen corresponding path program 22 times [2023-08-30 05:31:59,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:31:59,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245446138] [2023-08-30 05:31:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:31:59,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:31:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:32:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:32:00,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:32:00,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245446138] [2023-08-30 05:32:00,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245446138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:32:00,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:32:00,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-30 05:32:00,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383929376] [2023-08-30 05:32:00,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:32:00,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 05:32:00,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:32:00,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 05:32:00,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-30 05:32:00,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-08-30 05:32:00,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 427 transitions, 6376 flow. Second operand has 11 states, 11 states have (on average 137.36363636363637) internal successors, (1511), 11 states have internal predecessors, (1511), 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-08-30 05:32:00,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:32:00,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-08-30 05:32:00,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:32:09,680 INFO L130 PetriNetUnfolder]: 23431/44326 cut-off events. [2023-08-30 05:32:09,681 INFO L131 PetriNetUnfolder]: For 590299/593892 co-relation queries the response was YES. [2023-08-30 05:32:10,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236053 conditions, 44326 events. 23431/44326 cut-off events. For 590299/593892 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 419979 event pairs, 10564 based on Foata normal form. 366/43634 useless extension candidates. Maximal degree in co-relation 235945. Up to 33232 conditions per place. [2023-08-30 05:32:10,410 INFO L137 encePairwiseOnDemand]: 285/297 looper letters, 374 selfloop transitions, 52 changer transitions 11/502 dead transitions. [2023-08-30 05:32:10,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 502 transitions, 7960 flow [2023-08-30 05:32:10,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 05:32:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 05:32:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1188 transitions. [2023-08-30 05:32:10,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 05:32:10,412 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1188 transitions. [2023-08-30 05:32:10,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1188 transitions. [2023-08-30 05:32:10,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:32:10,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1188 transitions. [2023-08-30 05:32:10,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 148.5) internal successors, (1188), 8 states have internal predecessors, (1188), 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-08-30 05:32:10,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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-08-30 05:32:10,415 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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-08-30 05:32:10,415 INFO L175 Difference]: Start difference. First operand has 275 places, 427 transitions, 6376 flow. Second operand 8 states and 1188 transitions. [2023-08-30 05:32:10,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 502 transitions, 7960 flow [2023-08-30 05:32:14,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 502 transitions, 7834 flow, removed 52 selfloop flow, removed 5 redundant places. [2023-08-30 05:32:14,647 INFO L231 Difference]: Finished difference. Result has 277 places, 429 transitions, 6497 flow [2023-08-30 05:32:14,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6266, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6497, PETRI_PLACES=277, PETRI_TRANSITIONS=429} [2023-08-30 05:32:14,647 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 205 predicate places. [2023-08-30 05:32:14,648 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 429 transitions, 6497 flow [2023-08-30 05:32:14,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 137.36363636363637) internal successors, (1511), 11 states have internal predecessors, (1511), 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-08-30 05:32:14,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:32:14,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:32:14,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-30 05:32:14,649 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:32:14,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:32:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2020796068, now seen corresponding path program 23 times [2023-08-30 05:32:14,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:32:14,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315328071] [2023-08-30 05:32:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:32:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:32:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:32:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:32:15,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:32:15,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315328071] [2023-08-30 05:32:15,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315328071] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:32:15,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:32:15,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:32:15,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902362690] [2023-08-30 05:32:15,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:32:15,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 05:32:15,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:32:15,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 05:32:15,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 05:32:15,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-08-30 05:32:15,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 429 transitions, 6497 flow. Second operand has 8 states, 8 states have (on average 139.25) internal successors, (1114), 8 states have internal predecessors, (1114), 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-08-30 05:32:15,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:32:15,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-08-30 05:32:15,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:32:24,320 INFO L130 PetriNetUnfolder]: 22776/43872 cut-off events. [2023-08-30 05:32:24,320 INFO L131 PetriNetUnfolder]: For 594094/598516 co-relation queries the response was YES. [2023-08-30 05:32:24,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232728 conditions, 43872 events. 22776/43872 cut-off events. For 594094/598516 co-relation queries the response was YES. Maximal size of possible extension queue 1356. Compared 424329 event pairs, 11745 based on Foata normal form. 592/43357 useless extension candidates. Maximal degree in co-relation 232619. Up to 34359 conditions per place. [2023-08-30 05:32:24,924 INFO L137 encePairwiseOnDemand]: 287/297 looper letters, 358 selfloop transitions, 26 changer transitions 10/481 dead transitions. [2023-08-30 05:32:24,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 481 transitions, 7638 flow [2023-08-30 05:32:24,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 05:32:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 05:32:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1183 transitions. [2023-08-30 05:32:24,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978956228956229 [2023-08-30 05:32:24,927 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1183 transitions. [2023-08-30 05:32:24,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1183 transitions. [2023-08-30 05:32:24,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:32:24,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1183 transitions. [2023-08-30 05:32:24,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 147.875) internal successors, (1183), 8 states have internal predecessors, (1183), 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-08-30 05:32:24,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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-08-30 05:32:24,930 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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-08-30 05:32:24,930 INFO L175 Difference]: Start difference. First operand has 277 places, 429 transitions, 6497 flow. Second operand 8 states and 1183 transitions. [2023-08-30 05:32:24,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 481 transitions, 7638 flow [2023-08-30 05:32:28,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 481 transitions, 7558 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-30 05:32:28,354 INFO L231 Difference]: Finished difference. Result has 281 places, 427 transitions, 6464 flow [2023-08-30 05:32:28,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6419, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6464, PETRI_PLACES=281, PETRI_TRANSITIONS=427} [2023-08-30 05:32:28,355 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 209 predicate places. [2023-08-30 05:32:28,355 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 427 transitions, 6464 flow [2023-08-30 05:32:28,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 139.25) internal successors, (1114), 8 states have internal predecessors, (1114), 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-08-30 05:32:28,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:32:28,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:32:28,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-30 05:32:28,356 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:32:28,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:32:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1389521552, now seen corresponding path program 24 times [2023-08-30 05:32:28,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:32:28,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581128560] [2023-08-30 05:32:28,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:32:28,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:32:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:32:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:32:28,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:32:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581128560] [2023-08-30 05:32:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581128560] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:32:28,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:32:28,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-30 05:32:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596095173] [2023-08-30 05:32:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:32:28,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 05:32:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:32:28,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 05:32:28,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-08-30 05:32:29,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:32:29,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 427 transitions, 6464 flow. Second operand has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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-08-30 05:32:29,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:32:29,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:32:29,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:32:38,765 INFO L130 PetriNetUnfolder]: 24808/45958 cut-off events. [2023-08-30 05:32:38,765 INFO L131 PetriNetUnfolder]: For 628389/632377 co-relation queries the response was YES. [2023-08-30 05:32:39,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247659 conditions, 45958 events. 24808/45958 cut-off events. For 628389/632377 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 427406 event pairs, 12192 based on Foata normal form. 444/45216 useless extension candidates. Maximal degree in co-relation 247549. Up to 37573 conditions per place. [2023-08-30 05:32:39,452 INFO L137 encePairwiseOnDemand]: 282/297 looper letters, 419 selfloop transitions, 76 changer transitions 47/587 dead transitions. [2023-08-30 05:32:39,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 587 transitions, 9371 flow [2023-08-30 05:32:39,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-30 05:32:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-30 05:32:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2190 transitions. [2023-08-30 05:32:39,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49158249158249157 [2023-08-30 05:32:39,455 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2190 transitions. [2023-08-30 05:32:39,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2190 transitions. [2023-08-30 05:32:39,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:32:39,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2190 transitions. [2023-08-30 05:32:39,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 146.0) internal successors, (2190), 15 states have internal predecessors, (2190), 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-08-30 05:32:39,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 297.0) internal successors, (4752), 16 states have internal predecessors, (4752), 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-08-30 05:32:39,459 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 297.0) internal successors, (4752), 16 states have internal predecessors, (4752), 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-08-30 05:32:39,459 INFO L175 Difference]: Start difference. First operand has 281 places, 427 transitions, 6464 flow. Second operand 15 states and 2190 transitions. [2023-08-30 05:32:39,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 587 transitions, 9371 flow [2023-08-30 05:32:43,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 587 transitions, 9276 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-08-30 05:32:43,090 INFO L231 Difference]: Finished difference. Result has 301 places, 459 transitions, 7327 flow [2023-08-30 05:32:43,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6371, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7327, PETRI_PLACES=301, PETRI_TRANSITIONS=459} [2023-08-30 05:32:43,091 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 229 predicate places. [2023-08-30 05:32:43,091 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 459 transitions, 7327 flow [2023-08-30 05:32:43,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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-08-30 05:32:43,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:32:43,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:32:43,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-30 05:32:43,091 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:32:43,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:32:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash -625008696, now seen corresponding path program 25 times [2023-08-30 05:32:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:32:43,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678778869] [2023-08-30 05:32:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:32:43,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:32:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:32:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:32:43,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:32:43,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678778869] [2023-08-30 05:32:43,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678778869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:32:43,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:32:43,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 05:32:43,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389362970] [2023-08-30 05:32:43,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:32:43,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 05:32:43,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:32:43,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 05:32:43,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-30 05:32:43,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-30 05:32:43,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 459 transitions, 7327 flow. Second operand has 10 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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-08-30 05:32:43,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:32:43,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-30 05:32:43,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:32:54,509 INFO L130 PetriNetUnfolder]: 26577/50165 cut-off events. [2023-08-30 05:32:54,509 INFO L131 PetriNetUnfolder]: For 728834/732104 co-relation queries the response was YES. [2023-08-30 05:32:55,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275670 conditions, 50165 events. 26577/50165 cut-off events. For 728834/732104 co-relation queries the response was YES. Maximal size of possible extension queue 1494. Compared 480858 event pairs, 9817 based on Foata normal form. 784/50223 useless extension candidates. Maximal degree in co-relation 275549. Up to 31261 conditions per place. [2023-08-30 05:32:55,327 INFO L137 encePairwiseOnDemand]: 285/297 looper letters, 455 selfloop transitions, 151 changer transitions 7/650 dead transitions. [2023-08-30 05:32:55,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 650 transitions, 11097 flow [2023-08-30 05:32:55,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 05:32:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 05:32:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1626 transitions. [2023-08-30 05:32:55,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49770431588613406 [2023-08-30 05:32:55,330 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1626 transitions. [2023-08-30 05:32:55,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1626 transitions. [2023-08-30 05:32:55,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:32:55,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1626 transitions. [2023-08-30 05:32:55,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.8181818181818) internal successors, (1626), 11 states have internal predecessors, (1626), 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-08-30 05:32:55,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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-08-30 05:32:55,335 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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-08-30 05:32:55,335 INFO L175 Difference]: Start difference. First operand has 301 places, 459 transitions, 7327 flow. Second operand 11 states and 1626 transitions. [2023-08-30 05:32:55,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 650 transitions, 11097 flow [2023-08-30 05:33:00,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 650 transitions, 10862 flow, removed 110 selfloop flow, removed 4 redundant places. [2023-08-30 05:33:00,526 INFO L231 Difference]: Finished difference. Result has 314 places, 511 transitions, 8752 flow [2023-08-30 05:33:00,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=7112, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8752, PETRI_PLACES=314, PETRI_TRANSITIONS=511} [2023-08-30 05:33:00,527 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 242 predicate places. [2023-08-30 05:33:00,527 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 511 transitions, 8752 flow [2023-08-30 05:33:00,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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-08-30 05:33:00,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:33:00,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:33:00,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-30 05:33:00,528 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:33:00,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:33:00,528 INFO L85 PathProgramCache]: Analyzing trace with hash -69946838, now seen corresponding path program 26 times [2023-08-30 05:33:00,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:33:00,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736361749] [2023-08-30 05:33:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:33:00,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:33:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:33:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:33:01,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:33:01,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736361749] [2023-08-30 05:33:01,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736361749] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:33:01,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:33:01,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 05:33:01,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947992152] [2023-08-30 05:33:01,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:33:01,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 05:33:01,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:33:01,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 05:33:01,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:33:01,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-30 05:33:01,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 511 transitions, 8752 flow. Second operand has 9 states, 9 states have (on average 136.11111111111111) internal successors, (1225), 9 states have internal predecessors, (1225), 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-08-30 05:33:01,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:33:01,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-30 05:33:01,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:33:13,748 INFO L130 PetriNetUnfolder]: 28508/53648 cut-off events. [2023-08-30 05:33:13,748 INFO L131 PetriNetUnfolder]: For 876456/880274 co-relation queries the response was YES. [2023-08-30 05:33:14,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300003 conditions, 53648 events. 28508/53648 cut-off events. For 876456/880274 co-relation queries the response was YES. Maximal size of possible extension queue 1633. Compared 516368 event pairs, 10445 based on Foata normal form. 962/53760 useless extension candidates. Maximal degree in co-relation 299874. Up to 28896 conditions per place. [2023-08-30 05:33:14,656 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 430 selfloop transitions, 186 changer transitions 16/669 dead transitions. [2023-08-30 05:33:14,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 669 transitions, 11802 flow [2023-08-30 05:33:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 05:33:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 05:33:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1784 transitions. [2023-08-30 05:33:14,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500561167227834 [2023-08-30 05:33:14,659 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1784 transitions. [2023-08-30 05:33:14,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1784 transitions. [2023-08-30 05:33:14,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:33:14,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1784 transitions. [2023-08-30 05:33:14,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 148.66666666666666) internal successors, (1784), 12 states have internal predecessors, (1784), 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-08-30 05:33:14,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 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-08-30 05:33:14,663 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 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-08-30 05:33:14,663 INFO L175 Difference]: Start difference. First operand has 314 places, 511 transitions, 8752 flow. Second operand 12 states and 1784 transitions. [2023-08-30 05:33:14,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 669 transitions, 11802 flow [2023-08-30 05:33:20,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 669 transitions, 11577 flow, removed 108 selfloop flow, removed 1 redundant places. [2023-08-30 05:33:20,601 INFO L231 Difference]: Finished difference. Result has 331 places, 532 transitions, 9630 flow [2023-08-30 05:33:20,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=8599, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9630, PETRI_PLACES=331, PETRI_TRANSITIONS=532} [2023-08-30 05:33:20,602 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 259 predicate places. [2023-08-30 05:33:20,603 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 532 transitions, 9630 flow [2023-08-30 05:33:20,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 136.11111111111111) internal successors, (1225), 9 states have internal predecessors, (1225), 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-08-30 05:33:20,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:33:20,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:33:20,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-30 05:33:20,603 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:33:20,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:33:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1720644982, now seen corresponding path program 27 times [2023-08-30 05:33:20,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:33:20,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660788629] [2023-08-30 05:33:20,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:33:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:33:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:33:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:33:21,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:33:21,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660788629] [2023-08-30 05:33:21,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660788629] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:33:21,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:33:21,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 05:33:21,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979634528] [2023-08-30 05:33:21,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:33:21,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 05:33:21,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:33:21,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 05:33:21,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-08-30 05:33:21,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-30 05:33:21,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 532 transitions, 9630 flow. Second operand has 10 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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-08-30 05:33:21,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:33:21,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-30 05:33:21,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:33:34,890 INFO L130 PetriNetUnfolder]: 29140/55637 cut-off events. [2023-08-30 05:33:34,890 INFO L131 PetriNetUnfolder]: For 1039287/1042052 co-relation queries the response was YES. [2023-08-30 05:33:35,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320865 conditions, 55637 events. 29140/55637 cut-off events. For 1039287/1042052 co-relation queries the response was YES. Maximal size of possible extension queue 1725. Compared 547995 event pairs, 12071 based on Foata normal form. 491/55311 useless extension candidates. Maximal degree in co-relation 320728. Up to 41284 conditions per place. [2023-08-30 05:33:35,955 INFO L137 encePairwiseOnDemand]: 281/297 looper letters, 473 selfloop transitions, 159 changer transitions 12/681 dead transitions. [2023-08-30 05:33:35,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 681 transitions, 12956 flow [2023-08-30 05:33:35,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 05:33:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 05:33:35,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1513 transitions. [2023-08-30 05:33:35,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094276094276095 [2023-08-30 05:33:35,959 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1513 transitions. [2023-08-30 05:33:35,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1513 transitions. [2023-08-30 05:33:35,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:33:35,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1513 transitions. [2023-08-30 05:33:35,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 151.3) internal successors, (1513), 10 states have internal predecessors, (1513), 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-08-30 05:33:35,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-08-30 05:33:35,963 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-08-30 05:33:35,963 INFO L175 Difference]: Start difference. First operand has 331 places, 532 transitions, 9630 flow. Second operand 10 states and 1513 transitions. [2023-08-30 05:33:35,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 681 transitions, 12956 flow [2023-08-30 05:33:43,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 681 transitions, 12747 flow, removed 94 selfloop flow, removed 2 redundant places. [2023-08-30 05:33:43,458 INFO L231 Difference]: Finished difference. Result has 345 places, 562 transitions, 10797 flow [2023-08-30 05:33:43,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=9429, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10797, PETRI_PLACES=345, PETRI_TRANSITIONS=562} [2023-08-30 05:33:43,459 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 273 predicate places. [2023-08-30 05:33:43,459 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 562 transitions, 10797 flow [2023-08-30 05:33:43,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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-08-30 05:33:43,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:33:43,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:33:43,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-30 05:33:43,460 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:33:43,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:33:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1126259404, now seen corresponding path program 28 times [2023-08-30 05:33:43,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:33:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172658679] [2023-08-30 05:33:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:33:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:33:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:33:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:33:43,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:33:43,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172658679] [2023-08-30 05:33:43,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172658679] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:33:43,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:33:43,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 05:33:43,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758757996] [2023-08-30 05:33:43,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:33:43,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 05:33:43,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:33:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 05:33:43,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:33:44,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:33:44,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 562 transitions, 10797 flow. Second operand has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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-08-30 05:33:44,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:33:44,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:33:44,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:33:59,658 INFO L130 PetriNetUnfolder]: 28545/54439 cut-off events. [2023-08-30 05:33:59,659 INFO L131 PetriNetUnfolder]: For 1100473/1105227 co-relation queries the response was YES. [2023-08-30 05:34:00,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322829 conditions, 54439 events. 28545/54439 cut-off events. For 1100473/1105227 co-relation queries the response was YES. Maximal size of possible extension queue 1722. Compared 535669 event pairs, 13098 based on Foata normal form. 658/54135 useless extension candidates. Maximal degree in co-relation 322684. Up to 42363 conditions per place. [2023-08-30 05:34:00,729 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 485 selfloop transitions, 84 changer transitions 8/640 dead transitions. [2023-08-30 05:34:00,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 640 transitions, 12541 flow [2023-08-30 05:34:00,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 05:34:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 05:34:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1333 transitions. [2023-08-30 05:34:00,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4986906098017209 [2023-08-30 05:34:00,730 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1333 transitions. [2023-08-30 05:34:00,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1333 transitions. [2023-08-30 05:34:00,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:34:00,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1333 transitions. [2023-08-30 05:34:00,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 148.11111111111111) internal successors, (1333), 9 states have internal predecessors, (1333), 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-08-30 05:34:00,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:34:00,734 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-08-30 05:34:00,735 INFO L175 Difference]: Start difference. First operand has 345 places, 562 transitions, 10797 flow. Second operand 9 states and 1333 transitions. [2023-08-30 05:34:00,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 640 transitions, 12541 flow [2023-08-30 05:34:08,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 640 transitions, 12409 flow, removed 66 selfloop flow, removed 0 redundant places. [2023-08-30 05:34:08,854 INFO L231 Difference]: Finished difference. Result has 356 places, 563 transitions, 10852 flow [2023-08-30 05:34:08,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=10629, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10852, PETRI_PLACES=356, PETRI_TRANSITIONS=563} [2023-08-30 05:34:08,855 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 284 predicate places. [2023-08-30 05:34:08,855 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 563 transitions, 10852 flow [2023-08-30 05:34:08,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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-08-30 05:34:08,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:34:08,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:34:08,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-30 05:34:08,856 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:34:08,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:34:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1313248250, now seen corresponding path program 29 times [2023-08-30 05:34:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:34:08,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267602874] [2023-08-30 05:34:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:34:08,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:34:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:34:09,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:34:09,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267602874] [2023-08-30 05:34:09,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267602874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:34:09,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:34:09,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-30 05:34:09,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250353338] [2023-08-30 05:34:09,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:34:09,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 05:34:09,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:34:09,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 05:34:09,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-08-30 05:34:09,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-30 05:34:09,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 563 transitions, 10852 flow. Second operand has 11 states, 11 states have (on average 135.36363636363637) internal successors, (1489), 11 states have internal predecessors, (1489), 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-08-30 05:34:09,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:09,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-30 05:34:09,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:34:28,354 INFO L130 PetriNetUnfolder]: 37115/70027 cut-off events. [2023-08-30 05:34:28,354 INFO L131 PetriNetUnfolder]: For 1502858/1508385 co-relation queries the response was YES. [2023-08-30 05:34:29,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422227 conditions, 70027 events. 37115/70027 cut-off events. For 1502858/1508385 co-relation queries the response was YES. Maximal size of possible extension queue 2252. Compared 707928 event pairs, 16285 based on Foata normal form. 786/69672 useless extension candidates. Maximal degree in co-relation 422078. Up to 44692 conditions per place. [2023-08-30 05:34:29,928 INFO L137 encePairwiseOnDemand]: 282/297 looper letters, 630 selfloop transitions, 252 changer transitions 40/959 dead transitions. [2023-08-30 05:34:29,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 959 transitions, 19968 flow [2023-08-30 05:34:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 05:34:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 05:34:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1786 transitions. [2023-08-30 05:34:29,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011223344556678 [2023-08-30 05:34:29,930 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1786 transitions. [2023-08-30 05:34:29,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1786 transitions. [2023-08-30 05:34:29,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:34:29,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1786 transitions. [2023-08-30 05:34:29,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 148.83333333333334) internal successors, (1786), 12 states have internal predecessors, (1786), 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-08-30 05:34:29,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 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-08-30 05:34:29,935 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 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-08-30 05:34:29,935 INFO L175 Difference]: Start difference. First operand has 356 places, 563 transitions, 10852 flow. Second operand 12 states and 1786 transitions. [2023-08-30 05:34:29,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 959 transitions, 19968 flow [2023-08-30 05:34:40,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 959 transitions, 19852 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-30 05:34:40,378 INFO L231 Difference]: Finished difference. Result has 376 places, 762 transitions, 16551 flow [2023-08-30 05:34:40,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=10773, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16551, PETRI_PLACES=376, PETRI_TRANSITIONS=762} [2023-08-30 05:34:40,379 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 304 predicate places. [2023-08-30 05:34:40,379 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 762 transitions, 16551 flow [2023-08-30 05:34:40,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 135.36363636363637) internal successors, (1489), 11 states have internal predecessors, (1489), 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-08-30 05:34:40,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:34:40,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:34:40,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-30 05:34:40,379 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:34:40,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:34:40,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1223009686, now seen corresponding path program 30 times [2023-08-30 05:34:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:34:40,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476651950] [2023-08-30 05:34:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:34:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:34:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:34:40,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:34:40,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476651950] [2023-08-30 05:34:40,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476651950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:34:40,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:34:40,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-30 05:34:40,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513988773] [2023-08-30 05:34:40,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:34:40,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 05:34:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:34:40,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 05:34:40,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-08-30 05:34:40,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-30 05:34:40,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 762 transitions, 16551 flow. Second operand has 12 states, 12 states have (on average 135.08333333333334) internal successors, (1621), 12 states have internal predecessors, (1621), 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-08-30 05:34:40,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:40,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-30 05:34:40,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:35:05,879 INFO L130 PetriNetUnfolder]: 41789/79828 cut-off events. [2023-08-30 05:35:05,879 INFO L131 PetriNetUnfolder]: For 1946257/1953427 co-relation queries the response was YES. [2023-08-30 05:35:07,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500342 conditions, 79828 events. 41789/79828 cut-off events. For 1946257/1953427 co-relation queries the response was YES. Maximal size of possible extension queue 2614. Compared 828809 event pairs, 18200 based on Foata normal form. 1066/79504 useless extension candidates. Maximal degree in co-relation 500183. Up to 30263 conditions per place. [2023-08-30 05:35:08,167 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 757 selfloop transitions, 216 changer transitions 51/1061 dead transitions. [2023-08-30 05:35:08,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 1061 transitions, 22950 flow [2023-08-30 05:35:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 05:35:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 05:35:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2499 transitions. [2023-08-30 05:35:08,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2023-08-30 05:35:08,174 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2499 transitions. [2023-08-30 05:35:08,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2499 transitions. [2023-08-30 05:35:08,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:35:08,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2499 transitions. [2023-08-30 05:35:08,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 147.0) internal successors, (2499), 17 states have internal predecessors, (2499), 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-08-30 05:35:08,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 297.0) internal successors, (5346), 18 states have internal predecessors, (5346), 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-08-30 05:35:08,181 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 297.0) internal successors, (5346), 18 states have internal predecessors, (5346), 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-08-30 05:35:08,181 INFO L175 Difference]: Start difference. First operand has 376 places, 762 transitions, 16551 flow. Second operand 17 states and 2499 transitions. [2023-08-30 05:35:08,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 1061 transitions, 22950 flow [2023-08-30 05:35:25,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1061 transitions, 22522 flow, removed 214 selfloop flow, removed 2 redundant places. [2023-08-30 05:35:25,678 INFO L231 Difference]: Finished difference. Result has 399 places, 794 transitions, 18091 flow [2023-08-30 05:35:25,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=16241, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=762, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=18091, PETRI_PLACES=399, PETRI_TRANSITIONS=794} [2023-08-30 05:35:25,679 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 327 predicate places. [2023-08-30 05:35:25,679 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 794 transitions, 18091 flow [2023-08-30 05:35:25,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 135.08333333333334) internal successors, (1621), 12 states have internal predecessors, (1621), 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-08-30 05:35:25,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:35:25,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:35:25,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-30 05:35:25,680 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:35:25,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:35:25,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1163369418, now seen corresponding path program 31 times [2023-08-30 05:35:25,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:35:25,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125717503] [2023-08-30 05:35:25,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:35:25,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:35:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:35:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:35:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:35:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125717503] [2023-08-30 05:35:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125717503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:35:25,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:35:25,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:35:25,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001198028] [2023-08-30 05:35:25,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:35:25,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 05:35:25,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:35:25,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 05:35:25,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 05:35:26,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:35:26,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 794 transitions, 18091 flow. Second operand has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 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-08-30 05:35:26,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:35:26,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:35:26,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:35:55,819 INFO L130 PetriNetUnfolder]: 42420/81564 cut-off events. [2023-08-30 05:35:55,819 INFO L131 PetriNetUnfolder]: For 2048941/2056671 co-relation queries the response was YES. [2023-08-30 05:35:57,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519120 conditions, 81564 events. 42420/81564 cut-off events. For 2048941/2056671 co-relation queries the response was YES. Maximal size of possible extension queue 2823. Compared 860446 event pairs, 16049 based on Foata normal form. 1426/81648 useless extension candidates. Maximal degree in co-relation 518951. Up to 37586 conditions per place. [2023-08-30 05:35:57,871 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 506 selfloop transitions, 378 changer transitions 12/967 dead transitions. [2023-08-30 05:35:57,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 967 transitions, 22179 flow [2023-08-30 05:35:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 05:35:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 05:35:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1520 transitions. [2023-08-30 05:35:57,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117845117845118 [2023-08-30 05:35:57,873 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1520 transitions. [2023-08-30 05:35:57,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1520 transitions. [2023-08-30 05:35:57,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:35:57,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1520 transitions. [2023-08-30 05:35:57,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 152.0) internal successors, (1520), 10 states have internal predecessors, (1520), 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-08-30 05:35:57,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-08-30 05:35:57,876 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-08-30 05:35:57,876 INFO L175 Difference]: Start difference. First operand has 399 places, 794 transitions, 18091 flow. Second operand 10 states and 1520 transitions. [2023-08-30 05:35:57,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 967 transitions, 22179 flow [2023-08-30 05:36:15,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 967 transitions, 21766 flow, removed 183 selfloop flow, removed 7 redundant places. [2023-08-30 05:36:15,316 INFO L231 Difference]: Finished difference. Result has 400 places, 804 transitions, 19082 flow [2023-08-30 05:36:15,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=17660, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19082, PETRI_PLACES=400, PETRI_TRANSITIONS=804} [2023-08-30 05:36:15,316 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 328 predicate places. [2023-08-30 05:36:15,316 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 804 transitions, 19082 flow [2023-08-30 05:36:15,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 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-08-30 05:36:15,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:36:15,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:36:15,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-08-30 05:36:15,317 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:36:15,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:36:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash 860080012, now seen corresponding path program 32 times [2023-08-30 05:36:15,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:36:15,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480278061] [2023-08-30 05:36:15,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:36:15,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:36:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:36:15,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:36:15,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:36:15,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480278061] [2023-08-30 05:36:15,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480278061] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:36:15,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:36:15,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-30 05:36:15,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134574336] [2023-08-30 05:36:15,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:36:15,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 05:36:15,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:36:15,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 05:36:15,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-08-30 05:36:15,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-30 05:36:15,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 804 transitions, 19082 flow. Second operand has 12 states, 12 states have (on average 135.08333333333334) internal successors, (1621), 12 states have internal predecessors, (1621), 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-08-30 05:36:15,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:36:15,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-30 05:36:15,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:36:42,693 INFO L130 PetriNetUnfolder]: 42785/80685 cut-off events. [2023-08-30 05:36:42,693 INFO L131 PetriNetUnfolder]: For 2124674/2132679 co-relation queries the response was YES. [2023-08-30 05:36:44,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516738 conditions, 80685 events. 42785/80685 cut-off events. For 2124674/2132679 co-relation queries the response was YES. Maximal size of possible extension queue 2764. Compared 831696 event pairs, 22034 based on Foata normal form. 806/79730 useless extension candidates. Maximal degree in co-relation 516568. Up to 66866 conditions per place. [2023-08-30 05:36:44,989 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 713 selfloop transitions, 115 changer transitions 35/900 dead transitions. [2023-08-30 05:36:44,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 900 transitions, 21889 flow [2023-08-30 05:36:44,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 05:36:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 05:36:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1729 transitions. [2023-08-30 05:36:44,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851290684624018 [2023-08-30 05:36:44,992 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1729 transitions. [2023-08-30 05:36:44,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1729 transitions. [2023-08-30 05:36:44,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:36:44,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1729 transitions. [2023-08-30 05:36:44,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 144.08333333333334) internal successors, (1729), 12 states have internal predecessors, (1729), 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-08-30 05:36:44,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 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-08-30 05:36:44,997 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 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-08-30 05:36:44,997 INFO L175 Difference]: Start difference. First operand has 400 places, 804 transitions, 19082 flow. Second operand 12 states and 1729 transitions. [2023-08-30 05:36:44,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 900 transitions, 21889 flow [2023-08-30 05:37:02,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 900 transitions, 21713 flow, removed 56 selfloop flow, removed 2 redundant places. [2023-08-30 05:37:02,129 INFO L231 Difference]: Finished difference. Result has 415 places, 808 transitions, 19355 flow [2023-08-30 05:37:02,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=18906, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=19355, PETRI_PLACES=415, PETRI_TRANSITIONS=808} [2023-08-30 05:37:02,130 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 343 predicate places. [2023-08-30 05:37:02,130 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 808 transitions, 19355 flow [2023-08-30 05:37:02,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 135.08333333333334) internal successors, (1621), 12 states have internal predecessors, (1621), 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-08-30 05:37:02,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:37:02,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:37:02,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-08-30 05:37:02,131 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:37:02,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:37:02,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1677343552, now seen corresponding path program 33 times [2023-08-30 05:37:02,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:37:02,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577021297] [2023-08-30 05:37:02,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:37:02,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:37:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:37:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:37:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:37:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577021297] [2023-08-30 05:37:02,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577021297] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:37:02,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:37:02,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-30 05:37:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395362390] [2023-08-30 05:37:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:37:02,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 05:37:02,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:37:02,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 05:37:02,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-08-30 05:37:02,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:37:02,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 808 transitions, 19355 flow. Second operand has 11 states, 11 states have (on average 136.27272727272728) internal successors, (1499), 11 states have internal predecessors, (1499), 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-08-30 05:37:02,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:37:02,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:37:02,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:37:29,688 INFO L130 PetriNetUnfolder]: 41838/79467 cut-off events. [2023-08-30 05:37:29,689 INFO L131 PetriNetUnfolder]: For 2114936/2122104 co-relation queries the response was YES. [2023-08-30 05:37:31,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507676 conditions, 79467 events. 41838/79467 cut-off events. For 2114936/2122104 co-relation queries the response was YES. Maximal size of possible extension queue 2748. Compared 824391 event pairs, 20634 based on Foata normal form. 850/78570 useless extension candidates. Maximal degree in co-relation 507500. Up to 59985 conditions per place. [2023-08-30 05:37:32,008 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 665 selfloop transitions, 166 changer transitions 25/908 dead transitions. [2023-08-30 05:37:32,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 908 transitions, 22071 flow [2023-08-30 05:37:32,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 05:37:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 05:37:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1639 transitions. [2023-08-30 05:37:32,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016835016835017 [2023-08-30 05:37:32,011 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1639 transitions. [2023-08-30 05:37:32,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1639 transitions. [2023-08-30 05:37:32,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:37:32,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1639 transitions. [2023-08-30 05:37:32,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 149.0) internal successors, (1639), 11 states have internal predecessors, (1639), 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-08-30 05:37:32,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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-08-30 05:37:32,043 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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-08-30 05:37:32,043 INFO L175 Difference]: Start difference. First operand has 415 places, 808 transitions, 19355 flow. Second operand 11 states and 1639 transitions. [2023-08-30 05:37:32,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 908 transitions, 22071 flow [2023-08-30 05:37:49,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 908 transitions, 21773 flow, removed 63 selfloop flow, removed 11 redundant places. [2023-08-30 05:37:49,729 INFO L231 Difference]: Finished difference. Result has 413 places, 795 transitions, 19299 flow [2023-08-30 05:37:49,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=18560, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19299, PETRI_PLACES=413, PETRI_TRANSITIONS=795} [2023-08-30 05:37:49,730 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 341 predicate places. [2023-08-30 05:37:49,730 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 795 transitions, 19299 flow [2023-08-30 05:37:49,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 136.27272727272728) internal successors, (1499), 11 states have internal predecessors, (1499), 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-08-30 05:37:49,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:37:49,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:37:49,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-08-30 05:37:49,731 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:37:49,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:37:49,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1420984084, now seen corresponding path program 34 times [2023-08-30 05:37:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:37:49,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36274616] [2023-08-30 05:37:49,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:37:49,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:37:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:37:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:37:50,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:37:50,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36274616] [2023-08-30 05:37:50,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36274616] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:37:50,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:37:50,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-30 05:37:50,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311932948] [2023-08-30 05:37:50,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:37:50,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 05:37:50,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:37:50,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 05:37:50,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-30 05:37:50,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-30 05:37:50,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 795 transitions, 19299 flow. Second operand has 11 states, 11 states have (on average 135.36363636363637) internal successors, (1489), 11 states have internal predecessors, (1489), 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-08-30 05:37:50,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:37:50,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-30 05:37:50,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:38:17,664 INFO L130 PetriNetUnfolder]: 41779/79815 cut-off events. [2023-08-30 05:38:17,664 INFO L131 PetriNetUnfolder]: For 2086148/2093519 co-relation queries the response was YES. [2023-08-30 05:38:19,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509331 conditions, 79815 events. 41779/79815 cut-off events. For 2086148/2093519 co-relation queries the response was YES. Maximal size of possible extension queue 2762. Compared 832453 event pairs, 23771 based on Foata normal form. 424/78780 useless extension candidates. Maximal degree in co-relation 509157. Up to 66995 conditions per place. [2023-08-30 05:38:19,769 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 740 selfloop transitions, 5 changer transitions 73/855 dead transitions. [2023-08-30 05:38:19,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 855 transitions, 21492 flow [2023-08-30 05:38:19,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 05:38:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 05:38:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1424 transitions. [2023-08-30 05:38:19,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794612794612795 [2023-08-30 05:38:19,771 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1424 transitions. [2023-08-30 05:38:19,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1424 transitions. [2023-08-30 05:38:19,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:38:19,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1424 transitions. [2023-08-30 05:38:19,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 142.4) internal successors, (1424), 10 states have internal predecessors, (1424), 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-08-30 05:38:19,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-08-30 05:38:19,773 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-08-30 05:38:19,773 INFO L175 Difference]: Start difference. First operand has 413 places, 795 transitions, 19299 flow. Second operand 10 states and 1424 transitions. [2023-08-30 05:38:19,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 855 transitions, 21492 flow [2023-08-30 05:38:36,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 855 transitions, 21255 flow, removed 100 selfloop flow, removed 5 redundant places. [2023-08-30 05:38:36,142 INFO L231 Difference]: Finished difference. Result has 417 places, 777 transitions, 18595 flow [2023-08-30 05:38:36,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=19029, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18595, PETRI_PLACES=417, PETRI_TRANSITIONS=777} [2023-08-30 05:38:36,143 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 345 predicate places. [2023-08-30 05:38:36,143 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 777 transitions, 18595 flow [2023-08-30 05:38:36,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 135.36363636363637) internal successors, (1489), 11 states have internal predecessors, (1489), 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-08-30 05:38:36,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:38:36,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:38:36,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-08-30 05:38:36,144 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:38:36,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:38:36,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1565792504, now seen corresponding path program 35 times [2023-08-30 05:38:36,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:38:36,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410204525] [2023-08-30 05:38:36,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:38:36,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:38:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:38:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:38:36,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:38:36,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410204525] [2023-08-30 05:38:36,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410204525] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:38:36,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:38:36,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 05:38:36,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094465086] [2023-08-30 05:38:36,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:38:36,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 05:38:36,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:38:36,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 05:38:36,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 05:38:36,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 297 [2023-08-30 05:38:36,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 777 transitions, 18595 flow. Second operand has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 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-08-30 05:38:36,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:38:36,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 297 [2023-08-30 05:38:36,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:39:01,175 INFO L130 PetriNetUnfolder]: 38987/75216 cut-off events. [2023-08-30 05:39:01,175 INFO L131 PetriNetUnfolder]: For 1972099/1980447 co-relation queries the response was YES. [2023-08-30 05:39:03,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474860 conditions, 75216 events. 38987/75216 cut-off events. For 1972099/1980447 co-relation queries the response was YES. Maximal size of possible extension queue 2666. Compared 789088 event pairs, 20554 based on Foata normal form. 868/74373 useless extension candidates. Maximal degree in co-relation 474687. Up to 61690 conditions per place. [2023-08-30 05:39:03,451 INFO L137 encePairwiseOnDemand]: 287/297 looper letters, 622 selfloop transitions, 46 changer transitions 7/804 dead transitions. [2023-08-30 05:39:03,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 804 transitions, 20114 flow [2023-08-30 05:39:03,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 05:39:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 05:39:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2023-08-30 05:39:03,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067340067340067 [2023-08-30 05:39:03,453 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 903 transitions. [2023-08-30 05:39:03,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 903 transitions. [2023-08-30 05:39:03,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:39:03,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 903 transitions. [2023-08-30 05:39:03,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 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-08-30 05:39:03,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 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-08-30 05:39:03,456 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 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-08-30 05:39:03,456 INFO L175 Difference]: Start difference. First operand has 417 places, 777 transitions, 18595 flow. Second operand 6 states and 903 transitions. [2023-08-30 05:39:03,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 804 transitions, 20114 flow [2023-08-30 05:39:18,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 804 transitions, 19776 flow, removed 70 selfloop flow, removed 10 redundant places. [2023-08-30 05:39:18,578 INFO L231 Difference]: Finished difference. Result has 401 places, 772 transitions, 18261 flow [2023-08-30 05:39:18,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=18130, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=18261, PETRI_PLACES=401, PETRI_TRANSITIONS=772} [2023-08-30 05:39:18,579 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 329 predicate places. [2023-08-30 05:39:18,579 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 772 transitions, 18261 flow [2023-08-30 05:39:18,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 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-08-30 05:39:18,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:39:18,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:39:18,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-08-30 05:39:18,580 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:39:18,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:39:18,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1544462392, now seen corresponding path program 36 times [2023-08-30 05:39:18,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:39:18,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185491099] [2023-08-30 05:39:18,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:39:18,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:39:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:39:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:39:18,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:39:18,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185491099] [2023-08-30 05:39:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185491099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:39:18,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:39:18,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:39:18,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932253502] [2023-08-30 05:39:18,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:39:18,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 05:39:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:39:18,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 05:39:18,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:39:18,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-30 05:39:18,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 772 transitions, 18261 flow. Second operand has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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-08-30 05:39:18,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:39:18,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-30 05:39:18,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:39:59,322 INFO L130 PetriNetUnfolder]: 67781/111401 cut-off events. [2023-08-30 05:39:59,322 INFO L131 PetriNetUnfolder]: For 2515015/2519281 co-relation queries the response was YES. [2023-08-30 05:40:03,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674022 conditions, 111401 events. 67781/111401 cut-off events. For 2515015/2519281 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 989431 event pairs, 25871 based on Foata normal form. 1324/111740 useless extension candidates. Maximal degree in co-relation 673851. Up to 35311 conditions per place. [2023-08-30 05:40:03,775 INFO L137 encePairwiseOnDemand]: 289/297 looper letters, 1027 selfloop transitions, 25 changer transitions 334/1573 dead transitions. [2023-08-30 05:40:03,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 1573 transitions, 37463 flow [2023-08-30 05:40:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 05:40:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 05:40:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1655 transitions. [2023-08-30 05:40:03,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5065809611264157 [2023-08-30 05:40:03,778 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1655 transitions. [2023-08-30 05:40:03,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1655 transitions. [2023-08-30 05:40:03,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:40:03,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1655 transitions. [2023-08-30 05:40:03,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 150.45454545454547) internal successors, (1655), 11 states have internal predecessors, (1655), 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-08-30 05:40:03,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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-08-30 05:40:03,782 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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-08-30 05:40:03,782 INFO L175 Difference]: Start difference. First operand has 401 places, 772 transitions, 18261 flow. Second operand 11 states and 1655 transitions. [2023-08-30 05:40:03,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 1573 transitions, 37463 flow [2023-08-30 05:40:26,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 1573 transitions, 37271 flow, removed 34 selfloop flow, removed 5 redundant places. [2023-08-30 05:40:26,334 INFO L231 Difference]: Finished difference. Result has 411 places, 758 transitions, 17656 flow [2023-08-30 05:40:26,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=18127, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17656, PETRI_PLACES=411, PETRI_TRANSITIONS=758} [2023-08-30 05:40:26,335 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 339 predicate places. [2023-08-30 05:40:26,335 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 758 transitions, 17656 flow [2023-08-30 05:40:26,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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-08-30 05:40:26,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:40:26,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:40:26,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-08-30 05:40:26,336 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:40:26,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:40:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1196879374, now seen corresponding path program 37 times [2023-08-30 05:40:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:40:26,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944791075] [2023-08-30 05:40:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:40:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:40:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:40:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:40:26,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:40:26,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944791075] [2023-08-30 05:40:26,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944791075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:40:26,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:40:26,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 05:40:26,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102379277] [2023-08-30 05:40:26,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:40:26,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 05:40:26,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:40:26,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 05:40:26,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 05:40:26,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-08-30 05:40:26,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 758 transitions, 17656 flow. Second operand has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 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-08-30 05:40:26,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:40:26,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-08-30 05:40:26,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:40:51,597 INFO L130 PetriNetUnfolder]: 39482/76002 cut-off events. [2023-08-30 05:40:51,597 INFO L131 PetriNetUnfolder]: For 1902102/1910224 co-relation queries the response was YES. [2023-08-30 05:40:53,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488169 conditions, 76002 events. 39482/76002 cut-off events. For 1902102/1910224 co-relation queries the response was YES. Maximal size of possible extension queue 2636. Compared 791967 event pairs, 21086 based on Foata normal form. 711/75347 useless extension candidates. Maximal degree in co-relation 487995. Up to 63321 conditions per place. [2023-08-30 05:40:53,719 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 611 selfloop transitions, 34 changer transitions 8/778 dead transitions. [2023-08-30 05:40:53,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 778 transitions, 19107 flow [2023-08-30 05:40:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 05:40:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 05:40:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 740 transitions. [2023-08-30 05:40:53,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2023-08-30 05:40:53,720 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 740 transitions. [2023-08-30 05:40:53,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 740 transitions. [2023-08-30 05:40:53,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:40:53,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 740 transitions. [2023-08-30 05:40:53,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 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-08-30 05:40:53,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 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-08-30 05:40:53,722 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 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-08-30 05:40:53,722 INFO L175 Difference]: Start difference. First operand has 411 places, 758 transitions, 17656 flow. Second operand 5 states and 740 transitions. [2023-08-30 05:40:53,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 778 transitions, 19107 flow [2023-08-30 05:41:10,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 778 transitions, 18975 flow, removed 32 selfloop flow, removed 4 redundant places. [2023-08-30 05:41:10,341 INFO L231 Difference]: Finished difference. Result has 411 places, 752 transitions, 17421 flow [2023-08-30 05:41:10,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=17483, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=17421, PETRI_PLACES=411, PETRI_TRANSITIONS=752} [2023-08-30 05:41:10,341 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 339 predicate places. [2023-08-30 05:41:10,342 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 752 transitions, 17421 flow [2023-08-30 05:41:10,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 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-08-30 05:41:10,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:41:10,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:41:10,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-08-30 05:41:10,342 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:41:10,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:41:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1426013920, now seen corresponding path program 38 times [2023-08-30 05:41:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:41:10,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491988883] [2023-08-30 05:41:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:41:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:41:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:41:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:41:11,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:41:11,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491988883] [2023-08-30 05:41:11,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491988883] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:41:11,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:41:11,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 05:41:11,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302132874] [2023-08-30 05:41:11,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:41:11,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 05:41:11,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:41:11,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 05:41:11,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:41:11,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-08-30 05:41:11,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 752 transitions, 17421 flow. Second operand has 9 states, 9 states have (on average 138.0) internal successors, (1242), 9 states have internal predecessors, (1242), 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-08-30 05:41:11,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:41:11,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-08-30 05:41:11,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15