./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/popl20-counter-determinism.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 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 02:51:46,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 02:51:46,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 02:51:46,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 02:51:46,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 02:51:46,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 02:51:46,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 02:51:46,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 02:51:46,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 02:51:46,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 02:51:46,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 02:51:46,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 02:51:46,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 02:51:46,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 02:51:46,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 02:51:46,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 02:51:46,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 02:51:46,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 02:51:46,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 02:51:46,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 02:51:46,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 02:51:46,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 02:51:46,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 02:51:46,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 02:51:46,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 02:51:46,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 02:51:46,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 02:51:46,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 02:51:46,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 02:51:46,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 02:51:46,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 02:51:46,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 02:51:46,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 02:51:46,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 02:51:46,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 02:51:46,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 02:51:46,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 02:51:46,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 02:51:46,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 02:51:46,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 02:51:46,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 02:51:46,576 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-09-01 02:51:46,601 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 02:51:46,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 02:51:46,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 02:51:46,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 02:51:46,603 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 02:51:46,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 02:51:46,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 02:51:46,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 02:51:46,604 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 02:51:46,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 02:51:46,604 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 02:51:46,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 02:51:46,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 02:51:46,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 02:51:46,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 02:51:46,605 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 02:51:46,605 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 02:51:46,605 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 02:51:46,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 02:51:46,606 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 02:51:46,606 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 02:51:46,606 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 02:51:46,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 02:51:46,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 02:51:46,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 02:51:46,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 02:51:46,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 02:51:46,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 02:51:46,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 02:51:46,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 02:51:46,607 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 02:51:46,608 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 02:51:46,608 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 02:51:46,608 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 02:51:46,608 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 -> 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 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 -> BEFORE [2023-09-01 02:51:46,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 02:51:46,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 02:51:46,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 02:51:46,841 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 02:51:46,841 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 02:51:46,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-09-01 02:51:47,761 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 02:51:47,917 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 02:51:47,918 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-09-01 02:51:47,926 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388336c02/57e85553a1c04fa193ce1b30fe555dbf/FLAGe876b863c [2023-09-01 02:51:47,946 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388336c02/57e85553a1c04fa193ce1b30fe555dbf [2023-09-01 02:51:47,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 02:51:47,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 02:51:47,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 02:51:47,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 02:51:47,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 02:51:47,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:51:47" (1/1) ... [2023-09-01 02:51:47,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a1c76f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:47, skipping insertion in model container [2023-09-01 02:51:47,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:51:47" (1/1) ... [2023-09-01 02:51:47,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 02:51:47,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 02:51:48,106 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/popl20-counter-determinism.wvr.c[2476,2489] [2023-09-01 02:51:48,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 02:51:48,119 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 02:51:48,150 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/popl20-counter-determinism.wvr.c[2476,2489] [2023-09-01 02:51:48,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 02:51:48,159 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 02:51:48,159 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 02:51:48,164 INFO L208 MainTranslator]: Completed translation [2023-09-01 02:51:48,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48 WrapperNode [2023-09-01 02:51:48,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 02:51:48,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 02:51:48,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 02:51:48,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 02:51:48,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48" (1/1) ... [2023-09-01 02:51:48,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48" (1/1) ... [2023-09-01 02:51:48,207 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2023-09-01 02:51:48,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 02:51:48,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 02:51:48,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 02:51:48,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 02:51:48,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48" (1/1) ... [2023-09-01 02:51:48,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48" (1/1) ... [2023-09-01 02:51:48,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48" (1/1) ... [2023-09-01 02:51:48,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48" (1/1) ... [2023-09-01 02:51:48,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48" (1/1) ... [2023-09-01 02:51:48,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48" (1/1) ... [2023-09-01 02:51:48,243 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48" (1/1) ... [2023-09-01 02:51:48,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48" (1/1) ... [2023-09-01 02:51:48,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 02:51:48,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 02:51:48,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 02:51:48,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 02:51:48,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48" (1/1) ... [2023-09-01 02:51:48,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 02:51:48,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:51:48,269 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-09-01 02:51:48,276 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-09-01 02:51:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 02:51:48,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 02:51:48,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 02:51:48,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 02:51:48,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 02:51:48,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 02:51:48,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 02:51:48,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-09-01 02:51:48,320 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-09-01 02:51:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 02:51:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 02:51:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 02:51:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 02:51:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 02:51:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 02:51:48,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 02:51:48,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 02:51:48,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 02:51:48,322 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 02:51:48,384 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 02:51:48,385 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 02:51:48,680 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 02:51:48,736 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 02:51:48,736 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-01 02:51:48,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:51:48 BoogieIcfgContainer [2023-09-01 02:51:48,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 02:51:48,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 02:51:48,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 02:51:48,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 02:51:48,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 02:51:47" (1/3) ... [2023-09-01 02:51:48,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58325aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:51:48, skipping insertion in model container [2023-09-01 02:51:48,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:51:48" (2/3) ... [2023-09-01 02:51:48,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58325aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:51:48, skipping insertion in model container [2023-09-01 02:51:48,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:51:48" (3/3) ... [2023-09-01 02:51:48,747 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-09-01 02:51:48,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 02:51:48,759 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-09-01 02:51:48,759 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 02:51:48,847 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-09-01 02:51:48,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 140 transitions, 312 flow [2023-09-01 02:51:48,943 INFO L130 PetriNetUnfolder]: 9/136 cut-off events. [2023-09-01 02:51:48,943 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 02:51:48,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 136 events. 9/136 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 154 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-09-01 02:51:48,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 140 transitions, 312 flow [2023-09-01 02:51:48,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 132 transitions, 288 flow [2023-09-01 02:51:48,956 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 02:51:48,966 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 132 transitions, 288 flow [2023-09-01 02:51:48,969 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 132 transitions, 288 flow [2023-09-01 02:51:48,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 132 transitions, 288 flow [2023-09-01 02:51:49,006 INFO L130 PetriNetUnfolder]: 9/132 cut-off events. [2023-09-01 02:51:49,006 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 02:51:49,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 132 events. 9/132 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 151 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-09-01 02:51:49,010 INFO L119 LiptonReduction]: Number of co-enabled transitions 3160 [2023-09-01 02:51:52,012 INFO L134 LiptonReduction]: Checked pairs total: 3353 [2023-09-01 02:51:52,013 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-09-01 02:51:52,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 02:51:52,025 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;@aeb5bd4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 02:51:52,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-09-01 02:51:52,027 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-09-01 02:51:52,027 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 02:51:52,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:52,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 02:51:52,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:52,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:52,031 INFO L85 PathProgramCache]: Analyzing trace with hash 570, now seen corresponding path program 1 times [2023-09-01 02:51:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:52,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223242610] [2023-09-01 02:51:52,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:52,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223242610] [2023-09-01 02:51:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223242610] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:52,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 02:51:52,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714400565] [2023-09-01 02:51:52,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:52,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 02:51:52,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 02:51:52,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 02:51:52,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 267 [2023-09-01 02:51:52,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:52,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:52,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 267 [2023-09-01 02:51:52,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:52,341 INFO L130 PetriNetUnfolder]: 2546/3185 cut-off events. [2023-09-01 02:51:52,341 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-09-01 02:51:52,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6469 conditions, 3185 events. 2546/3185 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 11469 event pairs, 1193 based on Foata normal form. 0/1500 useless extension candidates. Maximal degree in co-relation 5013. Up to 3159 conditions per place. [2023-09-01 02:51:52,358 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 39 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2023-09-01 02:51:52,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 188 flow [2023-09-01 02:51:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 02:51:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 02:51:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 286 transitions. [2023-09-01 02:51:52,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5355805243445693 [2023-09-01 02:51:52,373 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 286 transitions. [2023-09-01 02:51:52,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 286 transitions. [2023-09-01 02:51:52,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:52,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 286 transitions. [2023-09-01 02:51:52,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:52,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:52,383 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:52,384 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 116 flow. Second operand 2 states and 286 transitions. [2023-09-01 02:51:52,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 188 flow [2023-09-01 02:51:52,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-09-01 02:51:52,390 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 94 flow [2023-09-01 02:51:52,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-09-01 02:51:52,394 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-09-01 02:51:52,394 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 94 flow [2023-09-01 02:51:52,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:52,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:52,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 02:51:52,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 02:51:52,397 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:52,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:52,404 INFO L85 PathProgramCache]: Analyzing trace with hash 561747, now seen corresponding path program 1 times [2023-09-01 02:51:52,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:52,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717681906] [2023-09-01 02:51:52,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:52,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717681906] [2023-09-01 02:51:52,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717681906] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:52,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:52,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:51:52,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736990209] [2023-09-01 02:51:52,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:52,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:51:52,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:52,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:51:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:51:52,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:51:52,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:52,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:52,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:51:52,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:52,866 INFO L130 PetriNetUnfolder]: 2435/3044 cut-off events. [2023-09-01 02:51:52,866 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-09-01 02:51:52,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6104 conditions, 3044 events. 2435/3044 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10831 event pairs, 1138 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 6101. Up to 3017 conditions per place. [2023-09-01 02:51:52,876 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 36 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-09-01 02:51:52,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 164 flow [2023-09-01 02:51:52,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:51:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:51:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-09-01 02:51:52,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681647940074906 [2023-09-01 02:51:52,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-09-01 02:51:52,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-09-01 02:51:52,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:52,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-09-01 02:51:52,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:52,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:52,881 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:52,881 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 94 flow. Second operand 3 states and 375 transitions. [2023-09-01 02:51:52,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 164 flow [2023-09-01 02:51:52,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 02:51:52,882 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 92 flow [2023-09-01 02:51:52,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-09-01 02:51:52,882 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-09-01 02:51:52,883 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 92 flow [2023-09-01 02:51:52,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:52,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:52,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 02:51:52,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 02:51:52,883 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:52,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:52,883 INFO L85 PathProgramCache]: Analyzing trace with hash 561748, now seen corresponding path program 1 times [2023-09-01 02:51:52,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:52,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210459456] [2023-09-01 02:51:52,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:52,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:53,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:53,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210459456] [2023-09-01 02:51:53,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210459456] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:53,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:53,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:51:53,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447471608] [2023-09-01 02:51:53,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:53,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:51:53,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:53,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:51:53,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:51:53,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 267 [2023-09-01 02:51:53,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:53,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 267 [2023-09-01 02:51:53,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:53,229 INFO L130 PetriNetUnfolder]: 2324/2903 cut-off events. [2023-09-01 02:51:53,229 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-09-01 02:51:53,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5824 conditions, 2903 events. 2324/2903 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10214 event pairs, 1083 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 5820. Up to 2876 conditions per place. [2023-09-01 02:51:53,240 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 34 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-09-01 02:51:53,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 158 flow [2023-09-01 02:51:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:51:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:51:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-09-01 02:51:53,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46192259675405745 [2023-09-01 02:51:53,242 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-09-01 02:51:53,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-09-01 02:51:53,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:53,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-09-01 02:51:53,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,245 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 92 flow. Second operand 3 states and 370 transitions. [2023-09-01 02:51:53,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 158 flow [2023-09-01 02:51:53,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:51:53,247 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 89 flow [2023-09-01 02:51:53,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-09-01 02:51:53,248 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2023-09-01 02:51:53,250 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 89 flow [2023-09-01 02:51:53,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:53,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 02:51:53,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 02:51:53,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:53,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:53,251 INFO L85 PathProgramCache]: Analyzing trace with hash 539853918, now seen corresponding path program 1 times [2023-09-01 02:51:53,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:53,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643841112] [2023-09-01 02:51:53,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:53,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:53,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:53,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643841112] [2023-09-01 02:51:53,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643841112] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:53,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:53,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:51:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709613829] [2023-09-01 02:51:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:53,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:51:53,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:53,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:51:53,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:51:53,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 267 [2023-09-01 02:51:53,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 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-09-01 02:51:53,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:53,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 267 [2023-09-01 02:51:53,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:53,536 INFO L130 PetriNetUnfolder]: 2278/2839 cut-off events. [2023-09-01 02:51:53,537 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-09-01 02:51:53,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5697 conditions, 2839 events. 2278/2839 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 9902 event pairs, 1061 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 5693. Up to 2812 conditions per place. [2023-09-01 02:51:53,547 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 32 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-09-01 02:51:53,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 151 flow [2023-09-01 02:51:53,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:51:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:51:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-09-01 02:51:53,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45942571785268416 [2023-09-01 02:51:53,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-09-01 02:51:53,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-09-01 02:51:53,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:53,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-09-01 02:51:53,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,551 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 89 flow. Second operand 3 states and 368 transitions. [2023-09-01 02:51:53,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 151 flow [2023-09-01 02:51:53,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:51:53,552 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 86 flow [2023-09-01 02:51:53,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-09-01 02:51:53,553 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -12 predicate places. [2023-09-01 02:51:53,553 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 86 flow [2023-09-01 02:51:53,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 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-09-01 02:51:53,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:53,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 02:51:53,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 02:51:53,554 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:53,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:53,554 INFO L85 PathProgramCache]: Analyzing trace with hash 539853917, now seen corresponding path program 1 times [2023-09-01 02:51:53,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:53,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610045251] [2023-09-01 02:51:53,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:53,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:53,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:53,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610045251] [2023-09-01 02:51:53,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610045251] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:53,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:53,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:51:53,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638812201] [2023-09-01 02:51:53,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:53,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:51:53,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:53,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:51:53,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:51:53,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 267 [2023-09-01 02:51:53,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:53,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 267 [2023-09-01 02:51:53,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:53,780 INFO L130 PetriNetUnfolder]: 2232/2775 cut-off events. [2023-09-01 02:51:53,780 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-09-01 02:51:53,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5570 conditions, 2775 events. 2232/2775 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 9649 event pairs, 1039 based on Foata normal form. 0/1346 useless extension candidates. Maximal degree in co-relation 5566. Up to 2748 conditions per place. [2023-09-01 02:51:53,793 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 30 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-09-01 02:51:53,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 144 flow [2023-09-01 02:51:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:51:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:51:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-09-01 02:51:53,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794007490636704 [2023-09-01 02:51:53,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-09-01 02:51:53,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-09-01 02:51:53,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:53,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-09-01 02:51:53,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,798 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 86 flow. Second operand 3 states and 384 transitions. [2023-09-01 02:51:53,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 144 flow [2023-09-01 02:51:53,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 143 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:51:53,799 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 83 flow [2023-09-01 02:51:53,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-09-01 02:51:53,801 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2023-09-01 02:51:53,802 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 83 flow [2023-09-01 02:51:53,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:53,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:51:53,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 02:51:53,802 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:53,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash -891413588, now seen corresponding path program 1 times [2023-09-01 02:51:53,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:53,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147526466] [2023-09-01 02:51:53,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:53,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:53,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:53,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147526466] [2023-09-01 02:51:53,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147526466] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:53,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:53,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:51:53,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137956356] [2023-09-01 02:51:53,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:53,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:51:53,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:53,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:51:53,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:51:53,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 267 [2023-09-01 02:51:53,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:53,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:53,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 267 [2023-09-01 02:51:53,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:54,009 INFO L130 PetriNetUnfolder]: 2126/2639 cut-off events. [2023-09-01 02:51:54,010 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-09-01 02:51:54,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5299 conditions, 2639 events. 2126/2639 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 9049 event pairs, 989 based on Foata normal form. 0/1296 useless extension candidates. Maximal degree in co-relation 5295. Up to 2612 conditions per place. [2023-09-01 02:51:54,024 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 28 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-09-01 02:51:54,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 137 flow [2023-09-01 02:51:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:51:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:51:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-09-01 02:51:54,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4769038701622971 [2023-09-01 02:51:54,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-09-01 02:51:54,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-09-01 02:51:54,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:54,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-09-01 02:51:54,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,029 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 83 flow. Second operand 3 states and 382 transitions. [2023-09-01 02:51:54,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 137 flow [2023-09-01 02:51:54,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:51:54,031 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 80 flow [2023-09-01 02:51:54,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-09-01 02:51:54,033 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -14 predicate places. [2023-09-01 02:51:54,033 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 80 flow [2023-09-01 02:51:54,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:54,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:51:54,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 02:51:54,034 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:54,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:54,035 INFO L85 PathProgramCache]: Analyzing trace with hash -891413586, now seen corresponding path program 1 times [2023-09-01 02:51:54,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:54,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65173957] [2023-09-01 02:51:54,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:54,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:54,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:54,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65173957] [2023-09-01 02:51:54,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65173957] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:54,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:54,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:51:54,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441213865] [2023-09-01 02:51:54,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:54,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:51:54,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:54,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:51:54,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:51:54,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 267 [2023-09-01 02:51:54,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:54,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 267 [2023-09-01 02:51:54,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:54,228 INFO L130 PetriNetUnfolder]: 2020/2503 cut-off events. [2023-09-01 02:51:54,229 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-09-01 02:51:54,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5028 conditions, 2503 events. 2020/2503 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8506 event pairs, 939 based on Foata normal form. 0/1246 useless extension candidates. Maximal degree in co-relation 5024. Up to 2476 conditions per place. [2023-09-01 02:51:54,239 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 26 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-09-01 02:51:54,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 130 flow [2023-09-01 02:51:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:51:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:51:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-09-01 02:51:54,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519350811485643 [2023-09-01 02:51:54,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-09-01 02:51:54,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-09-01 02:51:54,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:54,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-09-01 02:51:54,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,244 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,244 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 80 flow. Second operand 3 states and 362 transitions. [2023-09-01 02:51:54,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 130 flow [2023-09-01 02:51:54,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:51:54,245 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 77 flow [2023-09-01 02:51:54,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-09-01 02:51:54,246 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -15 predicate places. [2023-09-01 02:51:54,246 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 77 flow [2023-09-01 02:51:54,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:54,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:51:54,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 02:51:54,247 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:54,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1949952045, now seen corresponding path program 1 times [2023-09-01 02:51:54,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:54,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749520676] [2023-09-01 02:51:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:54,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:54,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:54,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749520676] [2023-09-01 02:51:54,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749520676] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:54,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:54,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 02:51:54,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083704407] [2023-09-01 02:51:54,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:54,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:51:54,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:54,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:51:54,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-09-01 02:51:54,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 267 [2023-09-01 02:51:54,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 77 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:54,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 267 [2023-09-01 02:51:54,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:54,525 INFO L130 PetriNetUnfolder]: 1606/2008 cut-off events. [2023-09-01 02:51:54,525 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-09-01 02:51:54,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4039 conditions, 2008 events. 1606/2008 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6641 event pairs, 741 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 4035. Up to 1981 conditions per place. [2023-09-01 02:51:54,534 INFO L137 encePairwiseOnDemand]: 265/267 looper letters, 25 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2023-09-01 02:51:54,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 127 flow [2023-09-01 02:51:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:51:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:51:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-09-01 02:51:54,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4044943820224719 [2023-09-01 02:51:54,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-09-01 02:51:54,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-09-01 02:51:54,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:54,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-09-01 02:51:54,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,538 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,538 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 77 flow. Second operand 3 states and 324 transitions. [2023-09-01 02:51:54,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 127 flow [2023-09-01 02:51:54,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:51:54,539 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow [2023-09-01 02:51:54,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-09-01 02:51:54,540 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -15 predicate places. [2023-09-01 02:51:54,540 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow [2023-09-01 02:51:54,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:54,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:51:54,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 02:51:54,541 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:54,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1949952046, now seen corresponding path program 1 times [2023-09-01 02:51:54,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:54,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856640409] [2023-09-01 02:51:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:54,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:54,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856640409] [2023-09-01 02:51:54,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856640409] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:54,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:54,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:51:54,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345010360] [2023-09-01 02:51:54,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:54,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:51:54,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:54,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:51:54,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:51:54,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:51:54,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:54,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:51:54,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:54,685 INFO L130 PetriNetUnfolder]: 1192/1513 cut-off events. [2023-09-01 02:51:54,685 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-09-01 02:51:54,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3050 conditions, 1513 events. 1192/1513 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4895 event pairs, 543 based on Foata normal form. 0/850 useless extension candidates. Maximal degree in co-relation 3046. Up to 1486 conditions per place. [2023-09-01 02:51:54,690 INFO L137 encePairwiseOnDemand]: 265/267 looper letters, 24 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-09-01 02:51:54,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 124 flow [2023-09-01 02:51:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:51:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:51:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-09-01 02:51:54,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519350811485643 [2023-09-01 02:51:54,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-09-01 02:51:54,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-09-01 02:51:54,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:54,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-09-01 02:51:54,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,695 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 3 states and 362 transitions. [2023-09-01 02:51:54,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 124 flow [2023-09-01 02:51:54,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 123 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:51:54,696 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 75 flow [2023-09-01 02:51:54,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-09-01 02:51:54,697 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -15 predicate places. [2023-09-01 02:51:54,697 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 75 flow [2023-09-01 02:51:54,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:54,698 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] [2023-09-01 02:51:54,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 02:51:54,698 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:54,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:54,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1815424840, now seen corresponding path program 1 times [2023-09-01 02:51:54,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:54,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329138780] [2023-09-01 02:51:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:54,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:54,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329138780] [2023-09-01 02:51:54,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329138780] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:54,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:54,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:51:54,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34403567] [2023-09-01 02:51:54,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:54,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:51:54,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:54,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:51:54,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:51:54,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 267 [2023-09-01 02:51:54,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:54,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 267 [2023-09-01 02:51:54,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:54,903 INFO L130 PetriNetUnfolder]: 1537/1954 cut-off events. [2023-09-01 02:51:54,904 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-09-01 02:51:54,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3956 conditions, 1954 events. 1537/1954 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6385 event pairs, 141 based on Foata normal form. 1/1124 useless extension candidates. Maximal degree in co-relation 3952. Up to 1733 conditions per place. [2023-09-01 02:51:54,910 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-09-01 02:51:54,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 220 flow [2023-09-01 02:51:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:51:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:51:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-09-01 02:51:54,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093632958801498 [2023-09-01 02:51:54,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-09-01 02:51:54,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-09-01 02:51:54,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:54,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-09-01 02:51:54,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,914 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 75 flow. Second operand 3 states and 408 transitions. [2023-09-01 02:51:54,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 220 flow [2023-09-01 02:51:54,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:51:54,915 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 107 flow [2023-09-01 02:51:54,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-09-01 02:51:54,916 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2023-09-01 02:51:54,916 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 107 flow [2023-09-01 02:51:54,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:54,916 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] [2023-09-01 02:51:54,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 02:51:54,917 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:54,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:54,917 INFO L85 PathProgramCache]: Analyzing trace with hash 207547760, now seen corresponding path program 1 times [2023-09-01 02:51:54,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:54,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32174993] [2023-09-01 02:51:54,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:54,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:54,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:54,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32174993] [2023-09-01 02:51:54,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32174993] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:54,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:54,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:51:54,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074462912] [2023-09-01 02:51:54,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:54,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:51:54,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:54,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:51:54,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:51:54,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-09-01 02:51:54,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:54,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:54,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-09-01 02:51:54,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:55,229 INFO L130 PetriNetUnfolder]: 2510/3336 cut-off events. [2023-09-01 02:51:55,230 INFO L131 PetriNetUnfolder]: For 897/897 co-relation queries the response was YES. [2023-09-01 02:51:55,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8203 conditions, 3336 events. 2510/3336 cut-off events. For 897/897 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14071 event pairs, 567 based on Foata normal form. 34/3306 useless extension candidates. Maximal degree in co-relation 8198. Up to 1535 conditions per place. [2023-09-01 02:51:55,246 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 88 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-09-01 02:51:55,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 95 transitions, 478 flow [2023-09-01 02:51:55,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:51:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:51:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-09-01 02:51:55,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883895131086142 [2023-09-01 02:51:55,249 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-09-01 02:51:55,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-09-01 02:51:55,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:55,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-09-01 02:51:55,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-09-01 02:51:55,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:55,254 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:55,254 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 107 flow. Second operand 5 states and 652 transitions. [2023-09-01 02:51:55,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 95 transitions, 478 flow [2023-09-01 02:51:55,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 95 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:51:55,257 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 137 flow [2023-09-01 02:51:55,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2023-09-01 02:51:55,258 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2023-09-01 02:51:55,258 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 137 flow [2023-09-01 02:51:55,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:55,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:55,259 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] [2023-09-01 02:51:55,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 02:51:55,259 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:55,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:55,260 INFO L85 PathProgramCache]: Analyzing trace with hash 767799170, now seen corresponding path program 2 times [2023-09-01 02:51:55,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:55,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328224918] [2023-09-01 02:51:55,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:55,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:55,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328224918] [2023-09-01 02:51:55,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328224918] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:51:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76739830] [2023-09-01 02:51:55,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 02:51:55,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:51:55,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:51:55,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:51:55,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 02:51:55,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:51:55,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:51:55,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:51:55,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:51:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:55,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:51:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:55,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76739830] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:51:55,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:51:55,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-09-01 02:51:55,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063806394] [2023-09-01 02:51:55,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:51:55,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 02:51:55,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:55,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 02:51:55,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-09-01 02:51:55,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:51:55,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 137 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:55,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:55,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:51:55,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:55,928 INFO L130 PetriNetUnfolder]: 3461/4613 cut-off events. [2023-09-01 02:51:55,928 INFO L131 PetriNetUnfolder]: For 3342/3760 co-relation queries the response was YES. [2023-09-01 02:51:55,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12816 conditions, 4613 events. 3461/4613 cut-off events. For 3342/3760 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 20093 event pairs, 743 based on Foata normal form. 507/5092 useless extension candidates. Maximal degree in co-relation 12808. Up to 2186 conditions per place. [2023-09-01 02:51:55,949 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 89 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2023-09-01 02:51:55,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 97 transitions, 538 flow [2023-09-01 02:51:55,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:51:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:51:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-09-01 02:51:55,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794007490636704 [2023-09-01 02:51:55,951 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-09-01 02:51:55,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-09-01 02:51:55,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:55,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-09-01 02:51:55,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:55,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:55,954 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:55,955 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 137 flow. Second operand 5 states and 640 transitions. [2023-09-01 02:51:55,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 97 transitions, 538 flow [2023-09-01 02:51:55,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 97 transitions, 519 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-09-01 02:51:55,965 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 172 flow [2023-09-01 02:51:55,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-09-01 02:51:55,965 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2023-09-01 02:51:55,965 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 172 flow [2023-09-01 02:51:55,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:55,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:55,966 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] [2023-09-01 02:51:55,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-09-01 02:51:56,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-09-01 02:51:56,172 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:56,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:56,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1486827478, now seen corresponding path program 3 times [2023-09-01 02:51:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:56,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170833742] [2023-09-01 02:51:56,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:56,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:56,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170833742] [2023-09-01 02:51:56,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170833742] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:56,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:56,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:51:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092273625] [2023-09-01 02:51:56,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:56,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:51:56,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:56,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:51:56,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:51:56,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-09-01 02:51:56,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:56,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:56,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-09-01 02:51:56,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:56,721 INFO L130 PetriNetUnfolder]: 5074/6883 cut-off events. [2023-09-01 02:51:56,721 INFO L131 PetriNetUnfolder]: For 9066/9653 co-relation queries the response was YES. [2023-09-01 02:51:56,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20615 conditions, 6883 events. 5074/6883 cut-off events. For 9066/9653 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 34237 event pairs, 1521 based on Foata normal form. 619/7423 useless extension candidates. Maximal degree in co-relation 20604. Up to 3592 conditions per place. [2023-09-01 02:51:56,747 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 97 selfloop transitions, 8 changer transitions 0/107 dead transitions. [2023-09-01 02:51:56,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 107 transitions, 663 flow [2023-09-01 02:51:56,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:51:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:51:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-09-01 02:51:56,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853932584269663 [2023-09-01 02:51:56,750 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-09-01 02:51:56,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-09-01 02:51:56,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:56,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-09-01 02:51:56,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:56,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:56,753 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:56,753 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 172 flow. Second operand 5 states and 648 transitions. [2023-09-01 02:51:56,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 107 transitions, 663 flow [2023-09-01 02:51:56,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 107 transitions, 649 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-09-01 02:51:56,759 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 229 flow [2023-09-01 02:51:56,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-09-01 02:51:56,760 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2023-09-01 02:51:56,760 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 229 flow [2023-09-01 02:51:56,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:56,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:56,760 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] [2023-09-01 02:51:56,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 02:51:56,761 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:56,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:56,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1385284445, now seen corresponding path program 1 times [2023-09-01 02:51:56,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:56,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410174351] [2023-09-01 02:51:56,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:56,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:56,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:56,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410174351] [2023-09-01 02:51:56,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410174351] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:51:56,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:51:56,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:51:56,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732429014] [2023-09-01 02:51:56,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:51:56,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:51:56,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:56,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:51:56,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:51:56,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:51:56,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:56,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:56,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:51:56,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:57,475 INFO L130 PetriNetUnfolder]: 6819/9240 cut-off events. [2023-09-01 02:51:57,475 INFO L131 PetriNetUnfolder]: For 19138/20147 co-relation queries the response was YES. [2023-09-01 02:51:57,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31070 conditions, 9240 events. 6819/9240 cut-off events. For 19138/20147 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 47660 event pairs, 1800 based on Foata normal form. 1026/10065 useless extension candidates. Maximal degree in co-relation 31056. Up to 3709 conditions per place. [2023-09-01 02:51:57,524 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 107 selfloop transitions, 12 changer transitions 0/122 dead transitions. [2023-09-01 02:51:57,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 122 transitions, 799 flow [2023-09-01 02:51:57,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:51:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:51:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2023-09-01 02:51:57,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49288389513108616 [2023-09-01 02:51:57,526 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions. [2023-09-01 02:51:57,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions. [2023-09-01 02:51:57,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:57,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions. [2023-09-01 02:51:57,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:57,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:57,530 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:57,530 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 229 flow. Second operand 5 states and 658 transitions. [2023-09-01 02:51:57,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 122 transitions, 799 flow [2023-09-01 02:51:57,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 759 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-09-01 02:51:57,543 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 311 flow [2023-09-01 02:51:57,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2023-09-01 02:51:57,543 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places. [2023-09-01 02:51:57,543 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 311 flow [2023-09-01 02:51:57,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:57,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:57,544 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] [2023-09-01 02:51:57,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 02:51:57,544 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:57,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:57,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1717524940, now seen corresponding path program 4 times [2023-09-01 02:51:57,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:57,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615482785] [2023-09-01 02:51:57,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:57,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:57,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615482785] [2023-09-01 02:51:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615482785] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:51:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016929364] [2023-09-01 02:51:57,610 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 02:51:57,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:51:57,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:51:57,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:51:57,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 02:51:57,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 02:51:57,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:51:57,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:51:57,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:51:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:57,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:51:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016929364] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:51:57,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:51:57,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-01 02:51:57,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455299843] [2023-09-01 02:51:57,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:51:57,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:51:57,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:57,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:51:57,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:51:57,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:51:57,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 311 flow. Second operand has 10 states, 10 states have (on average 115.4) internal successors, (1154), 10 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:57,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:57,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:51:57,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:58,673 INFO L130 PetriNetUnfolder]: 7477/10190 cut-off events. [2023-09-01 02:51:58,673 INFO L131 PetriNetUnfolder]: For 23311/24335 co-relation queries the response was YES. [2023-09-01 02:51:58,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34676 conditions, 10190 events. 7477/10190 cut-off events. For 23311/24335 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 52890 event pairs, 2146 based on Foata normal form. 1137/11105 useless extension candidates. Maximal degree in co-relation 34659. Up to 4817 conditions per place. [2023-09-01 02:51:58,725 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 107 selfloop transitions, 15 changer transitions 0/125 dead transitions. [2023-09-01 02:51:58,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 125 transitions, 881 flow [2023-09-01 02:51:58,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:51:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:51:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-09-01 02:51:58,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48764044943820223 [2023-09-01 02:51:58,727 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-09-01 02:51:58,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-09-01 02:51:58,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:51:58,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-09-01 02:51:58,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:58,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:58,730 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:58,730 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 311 flow. Second operand 5 states and 651 transitions. [2023-09-01 02:51:58,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 125 transitions, 881 flow [2023-09-01 02:51:58,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 125 transitions, 849 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-09-01 02:51:58,749 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 412 flow [2023-09-01 02:51:58,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=412, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-09-01 02:51:58,750 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2023-09-01 02:51:58,750 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 412 flow [2023-09-01 02:51:58,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.4) internal successors, (1154), 10 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:58,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:51:58,750 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] [2023-09-01 02:51:58,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-01 02:51:58,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-09-01 02:51:58,957 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:51:58,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:51:58,957 INFO L85 PathProgramCache]: Analyzing trace with hash 121399556, now seen corresponding path program 5 times [2023-09-01 02:51:58,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:51:58,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782481272] [2023-09-01 02:51:58,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:51:58,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:51:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:51:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:59,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:51:59,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782481272] [2023-09-01 02:51:59,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782481272] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:51:59,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721916828] [2023-09-01 02:51:59,026 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 02:51:59,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:51:59,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:51:59,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:51:59,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 02:51:59,096 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:51:59,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:51:59,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:51:59,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:51:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:59,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:51:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:51:59,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721916828] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:51:59,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:51:59,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-09-01 02:51:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40465522] [2023-09-01 02:51:59,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:51:59,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 02:51:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:51:59,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 02:51:59,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-09-01 02:51:59,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:51:59,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 412 flow. Second operand has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:51:59,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:51:59,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:51:59,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:51:59,881 INFO L130 PetriNetUnfolder]: 8095/10930 cut-off events. [2023-09-01 02:51:59,881 INFO L131 PetriNetUnfolder]: For 26014/27098 co-relation queries the response was YES. [2023-09-01 02:51:59,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39061 conditions, 10930 events. 8095/10930 cut-off events. For 26014/27098 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 57517 event pairs, 1572 based on Foata normal form. 1172/11959 useless extension candidates. Maximal degree in co-relation 39041. Up to 5493 conditions per place. [2023-09-01 02:52:00,001 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 100 selfloop transitions, 15 changer transitions 0/118 dead transitions. [2023-09-01 02:52:00,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 118 transitions, 898 flow [2023-09-01 02:52:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:52:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:52:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-09-01 02:52:00,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794007490636704 [2023-09-01 02:52:00,005 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-09-01 02:52:00,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-09-01 02:52:00,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:00,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-09-01 02:52:00,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:00,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:00,013 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:00,013 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 412 flow. Second operand 5 states and 640 transitions. [2023-09-01 02:52:00,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 118 transitions, 898 flow [2023-09-01 02:52:00,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 118 transitions, 876 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-09-01 02:52:00,042 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 456 flow [2023-09-01 02:52:00,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=456, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2023-09-01 02:52:00,043 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 21 predicate places. [2023-09-01 02:52:00,043 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 456 flow [2023-09-01 02:52:00,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:00,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:00,044 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] [2023-09-01 02:52:00,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 02:52:00,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:52:00,249 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:00,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash 389338049, now seen corresponding path program 2 times [2023-09-01 02:52:00,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:00,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433473258] [2023-09-01 02:52:00,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:00,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:00,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:00,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433473258] [2023-09-01 02:52:00,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433473258] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:52:00,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877390049] [2023-09-01 02:52:00,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 02:52:00,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:52:00,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:52:00,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:52:00,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 02:52:00,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:52:00,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:52:00,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:52:00,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:52:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:00,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:52:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877390049] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:52:00,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:52:00,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-09-01 02:52:00,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470663479] [2023-09-01 02:52:00,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:52:00,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 02:52:00,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:00,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 02:52:00,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-09-01 02:52:00,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:52:00,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 456 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:00,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:00,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:52:00,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:01,300 INFO L130 PetriNetUnfolder]: 8305/11430 cut-off events. [2023-09-01 02:52:01,300 INFO L131 PetriNetUnfolder]: For 35137/36517 co-relation queries the response was YES. [2023-09-01 02:52:01,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41668 conditions, 11430 events. 8305/11430 cut-off events. For 35137/36517 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 59915 event pairs, 1475 based on Foata normal form. 1531/12772 useless extension candidates. Maximal degree in co-relation 41646. Up to 5606 conditions per place. [2023-09-01 02:52:01,359 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 99 selfloop transitions, 13 changer transitions 0/120 dead transitions. [2023-09-01 02:52:01,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 120 transitions, 958 flow [2023-09-01 02:52:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:52:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:52:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-09-01 02:52:01,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779026217228464 [2023-09-01 02:52:01,374 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-09-01 02:52:01,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-09-01 02:52:01,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:01,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-09-01 02:52:01,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:01,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:01,379 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:01,379 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 456 flow. Second operand 5 states and 638 transitions. [2023-09-01 02:52:01,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 120 transitions, 958 flow [2023-09-01 02:52:01,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 120 transitions, 932 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 02:52:01,420 INFO L231 Difference]: Finished difference. Result has 80 places, 60 transitions, 483 flow [2023-09-01 02:52:01,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=483, PETRI_PLACES=80, PETRI_TRANSITIONS=60} [2023-09-01 02:52:01,420 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 25 predicate places. [2023-09-01 02:52:01,420 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 60 transitions, 483 flow [2023-09-01 02:52:01,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:01,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:01,421 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] [2023-09-01 02:52:01,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-01 02:52:01,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-09-01 02:52:01,625 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:01,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:01,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1551309662, now seen corresponding path program 1 times [2023-09-01 02:52:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:01,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998382129] [2023-09-01 02:52:01,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:01,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:01,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:01,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998382129] [2023-09-01 02:52:01,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998382129] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:52:01,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:52:01,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:52:01,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144208178] [2023-09-01 02:52:01,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:52:01,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:52:01,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:01,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:52:01,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:52:01,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-09-01 02:52:01,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 60 transitions, 483 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:01,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:01,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-09-01 02:52:01,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:02,630 INFO L130 PetriNetUnfolder]: 9253/12713 cut-off events. [2023-09-01 02:52:02,630 INFO L131 PetriNetUnfolder]: For 53007/54739 co-relation queries the response was YES. [2023-09-01 02:52:02,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49995 conditions, 12713 events. 9253/12713 cut-off events. For 53007/54739 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 69045 event pairs, 1923 based on Foata normal form. 1651/14072 useless extension candidates. Maximal degree in co-relation 49971. Up to 5537 conditions per place. [2023-09-01 02:52:02,696 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 116 selfloop transitions, 15 changer transitions 0/136 dead transitions. [2023-09-01 02:52:02,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 136 transitions, 1124 flow [2023-09-01 02:52:02,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:52:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:52:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-09-01 02:52:02,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883895131086142 [2023-09-01 02:52:02,698 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-09-01 02:52:02,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-09-01 02:52:02,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:02,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-09-01 02:52:02,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-09-01 02:52:02,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:02,701 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:02,701 INFO L175 Difference]: Start difference. First operand has 80 places, 60 transitions, 483 flow. Second operand 5 states and 652 transitions. [2023-09-01 02:52:02,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 136 transitions, 1124 flow [2023-09-01 02:52:02,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 136 transitions, 1094 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-09-01 02:52:02,756 INFO L231 Difference]: Finished difference. Result has 85 places, 62 transitions, 532 flow [2023-09-01 02:52:02,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=532, PETRI_PLACES=85, PETRI_TRANSITIONS=62} [2023-09-01 02:52:02,757 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2023-09-01 02:52:02,757 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 62 transitions, 532 flow [2023-09-01 02:52:02,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:02,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:02,757 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] [2023-09-01 02:52:02,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-09-01 02:52:02,758 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:02,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:02,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1124083191, now seen corresponding path program 3 times [2023-09-01 02:52:02,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:02,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852347215] [2023-09-01 02:52:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:02,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:02,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852347215] [2023-09-01 02:52:02,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852347215] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:52:02,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184834648] [2023-09-01 02:52:02,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 02:52:02,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:52:02,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:52:02,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:52:02,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-01 02:52:02,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 02:52:02,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:52:02,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:52:02,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:52:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:02,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:52:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184834648] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:52:02,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:52:02,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-01 02:52:02,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27264061] [2023-09-01 02:52:02,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:52:02,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:52:02,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:02,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:52:02,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:52:03,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:52:03,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 62 transitions, 532 flow. Second operand has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:03,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:03,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:52:03,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:04,522 INFO L130 PetriNetUnfolder]: 15721/21933 cut-off events. [2023-09-01 02:52:04,523 INFO L131 PetriNetUnfolder]: For 81160/82718 co-relation queries the response was YES. [2023-09-01 02:52:04,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89421 conditions, 21933 events. 15721/21933 cut-off events. For 81160/82718 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 130086 event pairs, 2315 based on Foata normal form. 1836/23221 useless extension candidates. Maximal degree in co-relation 89394. Up to 8916 conditions per place. [2023-09-01 02:52:04,661 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 172 selfloop transitions, 35 changer transitions 0/215 dead transitions. [2023-09-01 02:52:04,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 215 transitions, 1849 flow [2023-09-01 02:52:04,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:52:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:52:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1035 transitions. [2023-09-01 02:52:04,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845505617977528 [2023-09-01 02:52:04,665 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1035 transitions. [2023-09-01 02:52:04,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1035 transitions. [2023-09-01 02:52:04,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:04,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1035 transitions. [2023-09-01 02:52:04,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.375) internal successors, (1035), 8 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:04,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:04,670 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:04,670 INFO L175 Difference]: Start difference. First operand has 85 places, 62 transitions, 532 flow. Second operand 8 states and 1035 transitions. [2023-09-01 02:52:04,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 215 transitions, 1849 flow [2023-09-01 02:52:04,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 215 transitions, 1783 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-09-01 02:52:04,743 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 870 flow [2023-09-01 02:52:04,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=870, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2023-09-01 02:52:04,743 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 40 predicate places. [2023-09-01 02:52:04,743 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 870 flow [2023-09-01 02:52:04,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:04,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:04,744 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] [2023-09-01 02:52:04,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-01 02:52:04,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:52:04,949 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:04,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash 887138534, now seen corresponding path program 2 times [2023-09-01 02:52:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:04,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994141537] [2023-09-01 02:52:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:04,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:04,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994141537] [2023-09-01 02:52:04,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994141537] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:52:04,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:52:04,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:52:04,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87888400] [2023-09-01 02:52:04,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:52:04,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:52:05,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:05,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:52:05,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:52:05,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:52:05,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 870 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:05,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:05,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:52:05,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:05,649 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][29], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 103#L92-1true, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1075#true, Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:05,649 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-09-01 02:52:05,649 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-09-01 02:52:05,649 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-09-01 02:52:05,649 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-09-01 02:52:05,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][29], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1075#true, Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 12#L91-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:05,650 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-09-01 02:52:05,650 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-09-01 02:52:05,650 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-09-01 02:52:05,650 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-09-01 02:52:05,771 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 895#(= thread1Thread1of1ForFork0_~i~0 0), 103#L92-1true, 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 123#L41-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:05,771 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-09-01 02:52:05,771 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-09-01 02:52:05,771 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-09-01 02:52:05,772 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-09-01 02:52:05,772 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 895#(= thread1Thread1of1ForFork0_~i~0 0), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 1075#true, Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 12#L91-4true, 123#L41-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:05,772 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-09-01 02:52:05,773 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-09-01 02:52:05,773 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-09-01 02:52:05,773 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-09-01 02:52:05,865 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][29], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 103#L92-1true, 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1075#true, Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:05,865 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-09-01 02:52:05,865 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-09-01 02:52:05,865 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-09-01 02:52:05,865 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-09-01 02:52:05,932 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 103#L92-1true, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 77#thread1EXITtrue, 41#L51-4true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:05,933 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-09-01 02:52:05,933 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-09-01 02:52:05,933 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-09-01 02:52:05,933 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-09-01 02:52:05,934 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 77#thread1EXITtrue, 41#L51-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 1075#true, Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 12#L91-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:05,934 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-09-01 02:52:05,934 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-09-01 02:52:05,934 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-09-01 02:52:05,934 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-09-01 02:52:06,012 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 895#(= thread1Thread1of1ForFork0_~i~0 0), 103#L92-1true, 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 123#L41-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:06,012 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-09-01 02:52:06,012 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-09-01 02:52:06,013 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-09-01 02:52:06,013 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-09-01 02:52:06,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 103#L92-1true, 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 77#thread1EXITtrue, 41#L51-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:06,151 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-09-01 02:52:06,151 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-09-01 02:52:06,151 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-09-01 02:52:06,152 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-09-01 02:52:06,153 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 60#L92-2true, 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:06,153 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-09-01 02:52:06,153 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-09-01 02:52:06,153 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-09-01 02:52:06,153 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-09-01 02:52:06,322 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 60#L92-2true, 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:06,322 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-09-01 02:52:06,322 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-09-01 02:52:06,322 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-09-01 02:52:06,322 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-09-01 02:52:06,325 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 110#L93-1true, 16#L72-4true, 41#L51-4true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 1075#true, Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:06,325 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-09-01 02:52:06,325 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-09-01 02:52:06,325 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-09-01 02:52:06,325 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-09-01 02:52:06,590 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 110#L93-1true, 16#L72-4true, 41#L51-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:06,590 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 02:52:06,590 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-09-01 02:52:06,590 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-09-01 02:52:06,590 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 02:52:07,033 INFO L130 PetriNetUnfolder]: 17427/24411 cut-off events. [2023-09-01 02:52:07,034 INFO L131 PetriNetUnfolder]: For 128682/131017 co-relation queries the response was YES. [2023-09-01 02:52:07,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107723 conditions, 24411 events. 17427/24411 cut-off events. For 128682/131017 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 148981 event pairs, 2600 based on Foata normal form. 2717/26753 useless extension candidates. Maximal degree in co-relation 107692. Up to 9890 conditions per place. [2023-09-01 02:52:07,189 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 172 selfloop transitions, 50 changer transitions 0/227 dead transitions. [2023-09-01 02:52:07,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 227 transitions, 2529 flow [2023-09-01 02:52:07,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:52:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:52:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2023-09-01 02:52:07,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48002496878901374 [2023-09-01 02:52:07,192 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 769 transitions. [2023-09-01 02:52:07,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions. [2023-09-01 02:52:07,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:07,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions. [2023-09-01 02:52:07,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:07,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:07,195 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:07,195 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 870 flow. Second operand 6 states and 769 transitions. [2023-09-01 02:52:07,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 227 transitions, 2529 flow [2023-09-01 02:52:07,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 227 transitions, 2529 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 02:52:07,318 INFO L231 Difference]: Finished difference. Result has 103 places, 112 transitions, 1345 flow [2023-09-01 02:52:07,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1345, PETRI_PLACES=103, PETRI_TRANSITIONS=112} [2023-09-01 02:52:07,319 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2023-09-01 02:52:07,319 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 112 transitions, 1345 flow [2023-09-01 02:52:07,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:07,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:07,319 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] [2023-09-01 02:52:07,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-09-01 02:52:07,319 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:07,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:07,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1966858371, now seen corresponding path program 4 times [2023-09-01 02:52:07,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:07,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846770113] [2023-09-01 02:52:07,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:07,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:07,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:07,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846770113] [2023-09-01 02:52:07,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846770113] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:52:07,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:52:07,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:52:07,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650608460] [2023-09-01 02:52:07,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:52:07,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:52:07,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:07,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:52:07,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:52:07,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-09-01 02:52:07,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 112 transitions, 1345 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:07,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:07,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-09-01 02:52:07,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:09,621 INFO L130 PetriNetUnfolder]: 17150/24038 cut-off events. [2023-09-01 02:52:09,622 INFO L131 PetriNetUnfolder]: For 154577/156887 co-relation queries the response was YES. [2023-09-01 02:52:09,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117096 conditions, 24038 events. 17150/24038 cut-off events. For 154577/156887 co-relation queries the response was YES. Maximal size of possible extension queue 1301. Compared 146129 event pairs, 3227 based on Foata normal form. 2263/25463 useless extension candidates. Maximal degree in co-relation 117061. Up to 11204 conditions per place. [2023-09-01 02:52:09,754 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 147 selfloop transitions, 23 changer transitions 2/183 dead transitions. [2023-09-01 02:52:09,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 183 transitions, 2236 flow [2023-09-01 02:52:09,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:52:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:52:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-09-01 02:52:09,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48389513108614235 [2023-09-01 02:52:09,757 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-09-01 02:52:09,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-09-01 02:52:09,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:09,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-09-01 02:52:09,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:09,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:09,759 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:09,760 INFO L175 Difference]: Start difference. First operand has 103 places, 112 transitions, 1345 flow. Second operand 5 states and 646 transitions. [2023-09-01 02:52:09,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 183 transitions, 2236 flow [2023-09-01 02:52:10,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 183 transitions, 2099 flow, removed 41 selfloop flow, removed 2 redundant places. [2023-09-01 02:52:10,017 INFO L231 Difference]: Finished difference. Result has 107 places, 116 transitions, 1399 flow [2023-09-01 02:52:10,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1399, PETRI_PLACES=107, PETRI_TRANSITIONS=116} [2023-09-01 02:52:10,017 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 52 predicate places. [2023-09-01 02:52:10,017 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 116 transitions, 1399 flow [2023-09-01 02:52:10,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:10,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:10,018 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] [2023-09-01 02:52:10,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-09-01 02:52:10,018 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:10,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1479612490, now seen corresponding path program 3 times [2023-09-01 02:52:10,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:10,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651154106] [2023-09-01 02:52:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:10,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:10,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:10,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651154106] [2023-09-01 02:52:10,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651154106] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:52:10,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:52:10,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:52:10,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936524120] [2023-09-01 02:52:10,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:52:10,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:52:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:10,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:52:10,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:52:10,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:52:10,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 116 transitions, 1399 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:10,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:10,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:52:10,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:10,628 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][36], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1091#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1090#(<= 1 ~N~0), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 12#L91-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1078#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 1095#true, Black: 1077#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1081#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:10,629 INFO L383 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2023-09-01 02:52:10,629 INFO L386 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-09-01 02:52:10,629 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-09-01 02:52:10,629 INFO L386 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-09-01 02:52:10,808 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][36], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1091#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1090#(<= 1 ~N~0), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 103#L92-1true, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1078#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1077#(= thread3Thread1of1ForFork1_~i~2 0), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 1095#true, Black: 1081#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:10,808 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-09-01 02:52:10,808 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-09-01 02:52:10,808 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-09-01 02:52:10,808 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-09-01 02:52:10,809 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][36], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1091#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1090#(<= 1 ~N~0), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 12#L91-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1078#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1077#(= thread3Thread1of1ForFork1_~i~2 0), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 1095#true, Black: 1081#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:10,809 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-09-01 02:52:10,809 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-09-01 02:52:10,809 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-09-01 02:52:10,809 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-09-01 02:52:11,032 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][36], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1091#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1090#(<= 1 ~N~0), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 103#L92-1true, 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1078#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1077#(= thread3Thread1of1ForFork1_~i~2 0), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 1095#true, Black: 1081#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-09-01 02:52:11,032 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-09-01 02:52:11,032 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-09-01 02:52:11,032 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-09-01 02:52:11,033 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-09-01 02:52:12,123 INFO L130 PetriNetUnfolder]: 16637/23465 cut-off events. [2023-09-01 02:52:12,124 INFO L131 PetriNetUnfolder]: For 182759/185123 co-relation queries the response was YES. [2023-09-01 02:52:12,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110451 conditions, 23465 events. 16637/23465 cut-off events. For 182759/185123 co-relation queries the response was YES. Maximal size of possible extension queue 1312. Compared 143658 event pairs, 4321 based on Foata normal form. 2579/25515 useless extension candidates. Maximal degree in co-relation 110414. Up to 9365 conditions per place. [2023-09-01 02:52:12,281 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 152 selfloop transitions, 52 changer transitions 0/209 dead transitions. [2023-09-01 02:52:12,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 209 transitions, 2583 flow [2023-09-01 02:52:12,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:52:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:52:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2023-09-01 02:52:12,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-09-01 02:52:12,283 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2023-09-01 02:52:12,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2023-09-01 02:52:12,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:12,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2023-09-01 02:52:12,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:12,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:12,286 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:12,286 INFO L175 Difference]: Start difference. First operand has 107 places, 116 transitions, 1399 flow. Second operand 5 states and 650 transitions. [2023-09-01 02:52:12,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 209 transitions, 2583 flow [2023-09-01 02:52:12,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 209 transitions, 2502 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-09-01 02:52:12,753 INFO L231 Difference]: Finished difference. Result has 111 places, 138 transitions, 1880 flow [2023-09-01 02:52:12,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1880, PETRI_PLACES=111, PETRI_TRANSITIONS=138} [2023-09-01 02:52:12,754 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 56 predicate places. [2023-09-01 02:52:12,754 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 138 transitions, 1880 flow [2023-09-01 02:52:12,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:12,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:12,754 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] [2023-09-01 02:52:12,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-09-01 02:52:12,754 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:12,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:12,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1539562932, now seen corresponding path program 4 times [2023-09-01 02:52:12,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:12,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216126689] [2023-09-01 02:52:12,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:12,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:12,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:12,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216126689] [2023-09-01 02:52:12,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216126689] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:52:12,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171077753] [2023-09-01 02:52:12,810 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 02:52:12,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:52:12,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:52:12,811 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:52:12,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-01 02:52:12,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 02:52:12,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:52:12,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:52:12,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:52:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:12,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:52:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:12,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171077753] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:52:12,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:52:12,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-09-01 02:52:12,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274913049] [2023-09-01 02:52:12,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:52:12,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 02:52:12,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:12,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 02:52:12,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-09-01 02:52:12,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:52:12,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 138 transitions, 1880 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:12,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:12,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:52:12,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:15,219 INFO L130 PetriNetUnfolder]: 17939/25152 cut-off events. [2023-09-01 02:52:15,220 INFO L131 PetriNetUnfolder]: For 197071/199029 co-relation queries the response was YES. [2023-09-01 02:52:15,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123918 conditions, 25152 events. 17939/25152 cut-off events. For 197071/199029 co-relation queries the response was YES. Maximal size of possible extension queue 1349. Compared 150989 event pairs, 4685 based on Foata normal form. 1981/26557 useless extension candidates. Maximal degree in co-relation 123879. Up to 16480 conditions per place. [2023-09-01 02:52:15,403 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 151 selfloop transitions, 54 changer transitions 0/218 dead transitions. [2023-09-01 02:52:15,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 218 transitions, 3002 flow [2023-09-01 02:52:15,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:52:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:52:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-09-01 02:52:15,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4749063670411985 [2023-09-01 02:52:15,405 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-09-01 02:52:15,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-09-01 02:52:15,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:15,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-09-01 02:52:15,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:15,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:15,408 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:15,408 INFO L175 Difference]: Start difference. First operand has 111 places, 138 transitions, 1880 flow. Second operand 5 states and 634 transitions. [2023-09-01 02:52:15,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 218 transitions, 3002 flow [2023-09-01 02:52:16,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 218 transitions, 2904 flow, removed 28 selfloop flow, removed 1 redundant places. [2023-09-01 02:52:16,057 INFO L231 Difference]: Finished difference. Result has 116 places, 146 transitions, 2073 flow [2023-09-01 02:52:16,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2073, PETRI_PLACES=116, PETRI_TRANSITIONS=146} [2023-09-01 02:52:16,058 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 61 predicate places. [2023-09-01 02:52:16,058 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 146 transitions, 2073 flow [2023-09-01 02:52:16,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:16,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:16,058 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] [2023-09-01 02:52:16,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-09-01 02:52:16,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:52:16,259 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:16,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:16,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1927607435, now seen corresponding path program 1 times [2023-09-01 02:52:16,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:16,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252224288] [2023-09-01 02:52:16,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:16,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:16,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252224288] [2023-09-01 02:52:16,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252224288] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:52:16,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:52:16,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:52:16,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536689780] [2023-09-01 02:52:16,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:52:16,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:52:16,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:16,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:52:16,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:52:16,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-09-01 02:52:16,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 146 transitions, 2073 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:16,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:16,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-09-01 02:52:16,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:19,173 INFO L130 PetriNetUnfolder]: 20402/29889 cut-off events. [2023-09-01 02:52:19,173 INFO L131 PetriNetUnfolder]: For 264010/270580 co-relation queries the response was YES. [2023-09-01 02:52:19,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144824 conditions, 29889 events. 20402/29889 cut-off events. For 264010/270580 co-relation queries the response was YES. Maximal size of possible extension queue 1651. Compared 202505 event pairs, 4580 based on Foata normal form. 4902/34413 useless extension candidates. Maximal degree in co-relation 144783. Up to 10376 conditions per place. [2023-09-01 02:52:19,405 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 173 selfloop transitions, 39 changer transitions 1/231 dead transitions. [2023-09-01 02:52:19,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 231 transitions, 3138 flow [2023-09-01 02:52:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:52:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:52:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2023-09-01 02:52:19,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-09-01 02:52:19,407 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2023-09-01 02:52:19,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2023-09-01 02:52:19,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:19,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2023-09-01 02:52:19,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:19,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:19,410 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:19,410 INFO L175 Difference]: Start difference. First operand has 116 places, 146 transitions, 2073 flow. Second operand 5 states and 650 transitions. [2023-09-01 02:52:19,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 231 transitions, 3138 flow [2023-09-01 02:52:20,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 3080 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 02:52:20,122 INFO L231 Difference]: Finished difference. Result has 120 places, 147 transitions, 2112 flow [2023-09-01 02:52:20,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=2015, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2112, PETRI_PLACES=120, PETRI_TRANSITIONS=147} [2023-09-01 02:52:20,123 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 65 predicate places. [2023-09-01 02:52:20,123 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 147 transitions, 2112 flow [2023-09-01 02:52:20,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:20,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:20,123 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] [2023-09-01 02:52:20,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-09-01 02:52:20,123 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:20,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash 15975187, now seen corresponding path program 2 times [2023-09-01 02:52:20,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:20,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317459420] [2023-09-01 02:52:20,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:20,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:20,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317459420] [2023-09-01 02:52:20,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317459420] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:52:20,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873284456] [2023-09-01 02:52:20,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 02:52:20,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:52:20,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:52:20,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:52:20,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-01 02:52:20,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:52:20,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:52:20,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:52:20,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:52:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:20,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:52:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873284456] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:52:20,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:52:20,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-09-01 02:52:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239507979] [2023-09-01 02:52:20,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:52:20,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 02:52:20,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 02:52:20,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-09-01 02:52:20,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:52:20,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 147 transitions, 2112 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:20,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:20,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:52:20,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:24,538 INFO L130 PetriNetUnfolder]: 30135/43297 cut-off events. [2023-09-01 02:52:24,539 INFO L131 PetriNetUnfolder]: For 408004/413204 co-relation queries the response was YES. [2023-09-01 02:52:24,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218652 conditions, 43297 events. 30135/43297 cut-off events. For 408004/413204 co-relation queries the response was YES. Maximal size of possible extension queue 2127. Compared 293230 event pairs, 5542 based on Foata normal form. 4084/47106 useless extension candidates. Maximal degree in co-relation 218609. Up to 17048 conditions per place. [2023-09-01 02:52:24,901 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 329 selfloop transitions, 43 changer transitions 6/395 dead transitions. [2023-09-01 02:52:24,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 395 transitions, 6433 flow [2023-09-01 02:52:24,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:52:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:52:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2023-09-01 02:52:24,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47340823970037454 [2023-09-01 02:52:24,903 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2023-09-01 02:52:24,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2023-09-01 02:52:24,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:24,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2023-09-01 02:52:24,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:24,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:24,905 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:24,905 INFO L175 Difference]: Start difference. First operand has 120 places, 147 transitions, 2112 flow. Second operand 5 states and 632 transitions. [2023-09-01 02:52:24,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 395 transitions, 6433 flow [2023-09-01 02:52:26,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 395 transitions, 6268 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 02:52:26,318 INFO L231 Difference]: Finished difference. Result has 125 places, 185 transitions, 2852 flow [2023-09-01 02:52:26,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=2037, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2852, PETRI_PLACES=125, PETRI_TRANSITIONS=185} [2023-09-01 02:52:26,318 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 70 predicate places. [2023-09-01 02:52:26,319 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 185 transitions, 2852 flow [2023-09-01 02:52:26,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:26,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:26,320 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] [2023-09-01 02:52:26,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-09-01 02:52:26,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:52:26,527 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:26,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash -671385108, now seen corresponding path program 5 times [2023-09-01 02:52:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549612820] [2023-09-01 02:52:26,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:26,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:26,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:26,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549612820] [2023-09-01 02:52:26,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549612820] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:52:26,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:52:26,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:52:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202359211] [2023-09-01 02:52:26,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:52:26,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:52:26,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:26,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:52:26,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:52:26,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:52:26,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 185 transitions, 2852 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:26,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:26,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:52:26,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:30,909 INFO L130 PetriNetUnfolder]: 27421/39615 cut-off events. [2023-09-01 02:52:30,910 INFO L131 PetriNetUnfolder]: For 413299/416259 co-relation queries the response was YES. [2023-09-01 02:52:31,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211262 conditions, 39615 events. 27421/39615 cut-off events. For 413299/416259 co-relation queries the response was YES. Maximal size of possible extension queue 2098. Compared 271064 event pairs, 5827 based on Foata normal form. 3168/42134 useless extension candidates. Maximal degree in co-relation 211216. Up to 14838 conditions per place. [2023-09-01 02:52:31,257 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 178 selfloop transitions, 108 changer transitions 2/302 dead transitions. [2023-09-01 02:52:31,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 302 transitions, 4573 flow [2023-09-01 02:52:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:52:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:52:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2023-09-01 02:52:31,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4812734082397004 [2023-09-01 02:52:31,260 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2023-09-01 02:52:31,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2023-09-01 02:52:31,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:31,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2023-09-01 02:52:31,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:31,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:31,263 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:31,263 INFO L175 Difference]: Start difference. First operand has 125 places, 185 transitions, 2852 flow. Second operand 6 states and 771 transitions. [2023-09-01 02:52:31,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 302 transitions, 4573 flow [2023-09-01 02:52:32,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 302 transitions, 4532 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-09-01 02:52:32,684 INFO L231 Difference]: Finished difference. Result has 133 places, 210 transitions, 3591 flow [2023-09-01 02:52:32,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=2819, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3591, PETRI_PLACES=133, PETRI_TRANSITIONS=210} [2023-09-01 02:52:32,685 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 78 predicate places. [2023-09-01 02:52:32,685 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 210 transitions, 3591 flow [2023-09-01 02:52:32,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:32,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:32,685 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] [2023-09-01 02:52:32,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-09-01 02:52:32,686 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:32,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:32,686 INFO L85 PathProgramCache]: Analyzing trace with hash -496087306, now seen corresponding path program 6 times [2023-09-01 02:52:32,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:32,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206760443] [2023-09-01 02:52:32,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:32,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:32,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:32,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206760443] [2023-09-01 02:52:32,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206760443] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:52:32,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:52:32,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:52:32,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643687104] [2023-09-01 02:52:32,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:52:32,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:52:32,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:32,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:52:32,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:52:32,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-09-01 02:52:32,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 210 transitions, 3591 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:32,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:32,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-09-01 02:52:32,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:37,675 INFO L130 PetriNetUnfolder]: 28365/41426 cut-off events. [2023-09-01 02:52:37,675 INFO L131 PetriNetUnfolder]: For 511297/514382 co-relation queries the response was YES. [2023-09-01 02:52:37,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230886 conditions, 41426 events. 28365/41426 cut-off events. For 511297/514382 co-relation queries the response was YES. Maximal size of possible extension queue 2229. Compared 291733 event pairs, 8225 based on Foata normal form. 3029/43748 useless extension candidates. Maximal degree in co-relation 230836. Up to 23493 conditions per place. [2023-09-01 02:52:38,043 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 253 selfloop transitions, 45 changer transitions 6/318 dead transitions. [2023-09-01 02:52:38,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 318 transitions, 5475 flow [2023-09-01 02:52:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:52:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:52:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2023-09-01 02:52:38,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-09-01 02:52:38,045 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2023-09-01 02:52:38,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2023-09-01 02:52:38,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:38,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2023-09-01 02:52:38,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:38,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:38,047 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:38,047 INFO L175 Difference]: Start difference. First operand has 133 places, 210 transitions, 3591 flow. Second operand 5 states and 650 transitions. [2023-09-01 02:52:38,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 318 transitions, 5475 flow [2023-09-01 02:52:40,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 318 transitions, 5397 flow, removed 39 selfloop flow, removed 0 redundant places. [2023-09-01 02:52:40,044 INFO L231 Difference]: Finished difference. Result has 139 places, 213 transitions, 3709 flow [2023-09-01 02:52:40,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=3513, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3709, PETRI_PLACES=139, PETRI_TRANSITIONS=213} [2023-09-01 02:52:40,045 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 84 predicate places. [2023-09-01 02:52:40,045 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 213 transitions, 3709 flow [2023-09-01 02:52:40,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:40,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:40,045 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] [2023-09-01 02:52:40,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-09-01 02:52:40,045 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:40,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1842347611, now seen corresponding path program 3 times [2023-09-01 02:52:40,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:40,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235561536] [2023-09-01 02:52:40,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:40,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:40,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:40,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235561536] [2023-09-01 02:52:40,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235561536] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:52:40,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:52:40,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:52:40,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497972490] [2023-09-01 02:52:40,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:52:40,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:52:40,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:40,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:52:40,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:52:40,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:52:40,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 213 transitions, 3709 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:40,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:40,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:52:40,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:45,808 INFO L130 PetriNetUnfolder]: 33411/49244 cut-off events. [2023-09-01 02:52:45,808 INFO L131 PetriNetUnfolder]: For 663876/672333 co-relation queries the response was YES. [2023-09-01 02:52:46,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276664 conditions, 49244 events. 33411/49244 cut-off events. For 663876/672333 co-relation queries the response was YES. Maximal size of possible extension queue 2648. Compared 358919 event pairs, 9866 based on Foata normal form. 6107/54726 useless extension candidates. Maximal degree in co-relation 276611. Up to 20809 conditions per place. [2023-09-01 02:52:46,274 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 262 selfloop transitions, 65 changer transitions 14/376 dead transitions. [2023-09-01 02:52:46,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 376 transitions, 6551 flow [2023-09-01 02:52:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:52:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:52:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-09-01 02:52:46,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853932584269663 [2023-09-01 02:52:46,275 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-09-01 02:52:46,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-09-01 02:52:46,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:46,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-09-01 02:52:46,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:46,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:46,277 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:46,277 INFO L175 Difference]: Start difference. First operand has 139 places, 213 transitions, 3709 flow. Second operand 5 states and 648 transitions. [2023-09-01 02:52:46,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 376 transitions, 6551 flow [2023-09-01 02:52:47,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 376 transitions, 6413 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-09-01 02:52:47,956 INFO L231 Difference]: Finished difference. Result has 144 places, 242 transitions, 4318 flow [2023-09-01 02:52:47,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=3617, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4318, PETRI_PLACES=144, PETRI_TRANSITIONS=242} [2023-09-01 02:52:47,957 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 89 predicate places. [2023-09-01 02:52:47,957 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 242 transitions, 4318 flow [2023-09-01 02:52:47,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:47,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:47,958 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] [2023-09-01 02:52:47,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-09-01 02:52:47,958 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:47,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:47,958 INFO L85 PathProgramCache]: Analyzing trace with hash 944870335, now seen corresponding path program 4 times [2023-09-01 02:52:47,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:47,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853971825] [2023-09-01 02:52:47,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:47,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:48,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:48,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853971825] [2023-09-01 02:52:48,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853971825] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:52:48,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:52:48,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:52:48,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404486015] [2023-09-01 02:52:48,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:52:48,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:52:48,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:48,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:52:48,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:52:48,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:52:48,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 242 transitions, 4318 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:48,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:48,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:52:48,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:52:54,883 INFO L130 PetriNetUnfolder]: 37747/55963 cut-off events. [2023-09-01 02:52:54,883 INFO L131 PetriNetUnfolder]: For 800880/807523 co-relation queries the response was YES. [2023-09-01 02:52:55,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333466 conditions, 55963 events. 37747/55963 cut-off events. For 800880/807523 co-relation queries the response was YES. Maximal size of possible extension queue 2967. Compared 420291 event pairs, 9640 based on Foata normal form. 5979/61247 useless extension candidates. Maximal degree in co-relation 333410. Up to 26850 conditions per place. [2023-09-01 02:52:55,490 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 474 selfloop transitions, 61 changer transitions 36/606 dead transitions. [2023-09-01 02:52:55,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 606 transitions, 11486 flow [2023-09-01 02:52:55,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:52:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:52:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2023-09-01 02:52:55,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47752808988764045 [2023-09-01 02:52:55,492 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2023-09-01 02:52:55,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2023-09-01 02:52:55,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:52:55,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2023-09-01 02:52:55,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:55,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:55,495 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:55,495 INFO L175 Difference]: Start difference. First operand has 144 places, 242 transitions, 4318 flow. Second operand 6 states and 765 transitions. [2023-09-01 02:52:55,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 606 transitions, 11486 flow [2023-09-01 02:52:58,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 606 transitions, 11367 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-09-01 02:52:58,481 INFO L231 Difference]: Finished difference. Result has 152 places, 292 transitions, 5448 flow [2023-09-01 02:52:58,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=4259, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5448, PETRI_PLACES=152, PETRI_TRANSITIONS=292} [2023-09-01 02:52:58,482 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 97 predicate places. [2023-09-01 02:52:58,482 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 292 transitions, 5448 flow [2023-09-01 02:52:58,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:58,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:52:58,482 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] [2023-09-01 02:52:58,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-09-01 02:52:58,483 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:52:58,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:52:58,483 INFO L85 PathProgramCache]: Analyzing trace with hash -868880549, now seen corresponding path program 5 times [2023-09-01 02:52:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:52:58,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806638198] [2023-09-01 02:52:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:52:58,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:52:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:52:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:52:58,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:52:58,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806638198] [2023-09-01 02:52:58,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806638198] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:52:58,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:52:58,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:52:58,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416588600] [2023-09-01 02:52:58,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:52:58,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:52:58,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:52:58,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:52:58,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:52:58,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-09-01 02:52:58,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 292 transitions, 5448 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:52:58,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:52:58,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-09-01 02:52:58,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:53:06,321 INFO L130 PetriNetUnfolder]: 38974/58937 cut-off events. [2023-09-01 02:53:06,322 INFO L131 PetriNetUnfolder]: For 946683/952430 co-relation queries the response was YES. [2023-09-01 02:53:06,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377028 conditions, 58937 events. 38974/58937 cut-off events. For 946683/952430 co-relation queries the response was YES. Maximal size of possible extension queue 3181. Compared 459318 event pairs, 10822 based on Foata normal form. 4722/62980 useless extension candidates. Maximal degree in co-relation 376968. Up to 28090 conditions per place. [2023-09-01 02:53:07,251 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 295 selfloop transitions, 87 changer transitions 18/435 dead transitions. [2023-09-01 02:53:07,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 435 transitions, 8277 flow [2023-09-01 02:53:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:53:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:53:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-09-01 02:53:07,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853932584269663 [2023-09-01 02:53:07,252 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-09-01 02:53:07,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-09-01 02:53:07,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:53:07,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-09-01 02:53:07,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:07,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:07,254 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:07,254 INFO L175 Difference]: Start difference. First operand has 152 places, 292 transitions, 5448 flow. Second operand 5 states and 648 transitions. [2023-09-01 02:53:07,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 435 transitions, 8277 flow [2023-09-01 02:53:12,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 435 transitions, 8224 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-09-01 02:53:12,169 INFO L231 Difference]: Finished difference. Result has 157 places, 295 transitions, 5657 flow [2023-09-01 02:53:12,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=5417, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5657, PETRI_PLACES=157, PETRI_TRANSITIONS=295} [2023-09-01 02:53:12,170 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 102 predicate places. [2023-09-01 02:53:12,170 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 295 transitions, 5657 flow [2023-09-01 02:53:12,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:12,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:53:12,170 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] [2023-09-01 02:53:12,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-09-01 02:53:12,170 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:53:12,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:53:12,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1163998239, now seen corresponding path program 5 times [2023-09-01 02:53:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:53:12,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898180143] [2023-09-01 02:53:12,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:53:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:53:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:53:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:53:12,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:53:12,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898180143] [2023-09-01 02:53:12,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898180143] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:53:12,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:53:12,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:53:12,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129718140] [2023-09-01 02:53:12,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:53:12,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:53:12,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:53:12,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:53:12,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:53:12,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-09-01 02:53:12,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 295 transitions, 5657 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:12,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:53:12,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-09-01 02:53:12,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:53:20,152 INFO L130 PetriNetUnfolder]: 38801/59204 cut-off events. [2023-09-01 02:53:20,153 INFO L131 PetriNetUnfolder]: For 1016268/1023002 co-relation queries the response was YES. [2023-09-01 02:53:20,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383594 conditions, 59204 events. 38801/59204 cut-off events. For 1016268/1023002 co-relation queries the response was YES. Maximal size of possible extension queue 3532. Compared 473027 event pairs, 10233 based on Foata normal form. 6289/64289 useless extension candidates. Maximal degree in co-relation 383531. Up to 25584 conditions per place. [2023-09-01 02:53:21,110 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 306 selfloop transitions, 66 changer transitions 21/425 dead transitions. [2023-09-01 02:53:21,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 425 transitions, 8141 flow [2023-09-01 02:53:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:53:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:53:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-09-01 02:53:21,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898876404494382 [2023-09-01 02:53:21,112 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-09-01 02:53:21,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-09-01 02:53:21,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:53:21,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-09-01 02:53:21,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:21,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:21,114 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:21,114 INFO L175 Difference]: Start difference. First operand has 157 places, 295 transitions, 5657 flow. Second operand 5 states and 654 transitions. [2023-09-01 02:53:21,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 425 transitions, 8141 flow [2023-09-01 02:53:25,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 425 transitions, 7887 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-09-01 02:53:25,192 INFO L231 Difference]: Finished difference. Result has 161 places, 300 transitions, 5771 flow [2023-09-01 02:53:25,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=5483, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5771, PETRI_PLACES=161, PETRI_TRANSITIONS=300} [2023-09-01 02:53:25,193 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 106 predicate places. [2023-09-01 02:53:25,193 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 300 transitions, 5771 flow [2023-09-01 02:53:25,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:25,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:53:25,193 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] [2023-09-01 02:53:25,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-09-01 02:53:25,193 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:53:25,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:53:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash 130711419, now seen corresponding path program 6 times [2023-09-01 02:53:25,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:53:25,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393400796] [2023-09-01 02:53:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:53:25,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:53:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:53:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:53:25,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:53:25,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393400796] [2023-09-01 02:53:25,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393400796] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:53:25,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:53:25,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:53:25,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361807323] [2023-09-01 02:53:25,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:53:25,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:53:25,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:53:25,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:53:25,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:53:25,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:53:25,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 300 transitions, 5771 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:25,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:53:25,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:53:25,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:53:33,320 INFO L130 PetriNetUnfolder]: 38036/58263 cut-off events. [2023-09-01 02:53:33,321 INFO L131 PetriNetUnfolder]: For 1017847/1024181 co-relation queries the response was YES. [2023-09-01 02:53:33,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373173 conditions, 58263 events. 38036/58263 cut-off events. For 1017847/1024181 co-relation queries the response was YES. Maximal size of possible extension queue 3253. Compared 464460 event pairs, 11512 based on Foata normal form. 5904/63500 useless extension candidates. Maximal degree in co-relation 373108. Up to 26990 conditions per place. [2023-09-01 02:53:34,058 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 289 selfloop transitions, 124 changer transitions 23/469 dead transitions. [2023-09-01 02:53:34,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 469 transitions, 9326 flow [2023-09-01 02:53:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:53:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:53:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-09-01 02:53:34,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48389513108614235 [2023-09-01 02:53:34,060 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-09-01 02:53:34,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-09-01 02:53:34,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:53:34,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-09-01 02:53:34,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:34,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:34,062 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:34,062 INFO L175 Difference]: Start difference. First operand has 161 places, 300 transitions, 5771 flow. Second operand 5 states and 646 transitions. [2023-09-01 02:53:34,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 469 transitions, 9326 flow [2023-09-01 02:53:39,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 469 transitions, 9146 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-09-01 02:53:39,773 INFO L231 Difference]: Finished difference. Result has 166 places, 333 transitions, 6739 flow [2023-09-01 02:53:39,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=5651, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6739, PETRI_PLACES=166, PETRI_TRANSITIONS=333} [2023-09-01 02:53:39,773 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 111 predicate places. [2023-09-01 02:53:39,774 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 333 transitions, 6739 flow [2023-09-01 02:53:39,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:39,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:53:39,774 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] [2023-09-01 02:53:39,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-09-01 02:53:39,774 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:53:39,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:53:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash 743299887, now seen corresponding path program 7 times [2023-09-01 02:53:39,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:53:39,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081391263] [2023-09-01 02:53:39,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:53:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:53:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:53:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:53:39,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:53:39,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081391263] [2023-09-01 02:53:39,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081391263] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:53:39,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:53:39,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:53:39,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849529129] [2023-09-01 02:53:39,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:53:39,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:53:39,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:53:39,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:53:39,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:53:39,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:53:39,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 333 transitions, 6739 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:39,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:53:39,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:53:39,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:53:49,050 INFO L130 PetriNetUnfolder]: 41241/63199 cut-off events. [2023-09-01 02:53:49,050 INFO L131 PetriNetUnfolder]: For 1149652/1152390 co-relation queries the response was YES. [2023-09-01 02:53:49,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418924 conditions, 63199 events. 41241/63199 cut-off events. For 1149652/1152390 co-relation queries the response was YES. Maximal size of possible extension queue 3445. Compared 507887 event pairs, 9740 based on Foata normal form. 3242/66071 useless extension candidates. Maximal degree in co-relation 418856. Up to 26002 conditions per place. [2023-09-01 02:53:49,980 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 475 selfloop transitions, 107 changer transitions 51/675 dead transitions. [2023-09-01 02:53:49,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 675 transitions, 13778 flow [2023-09-01 02:53:49,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:53:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:53:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions. [2023-09-01 02:53:49,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787765293383271 [2023-09-01 02:53:49,982 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 767 transitions. [2023-09-01 02:53:49,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions. [2023-09-01 02:53:49,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:53:49,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions. [2023-09-01 02:53:49,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:49,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:49,984 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:53:49,984 INFO L175 Difference]: Start difference. First operand has 166 places, 333 transitions, 6739 flow. Second operand 6 states and 767 transitions. [2023-09-01 02:53:49,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 675 transitions, 13778 flow [2023-09-01 02:54:00,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 675 transitions, 13446 flow, removed 100 selfloop flow, removed 1 redundant places. [2023-09-01 02:54:00,542 INFO L231 Difference]: Finished difference. Result has 174 places, 411 transitions, 8510 flow [2023-09-01 02:54:00,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=6499, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8510, PETRI_PLACES=174, PETRI_TRANSITIONS=411} [2023-09-01 02:54:00,542 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 119 predicate places. [2023-09-01 02:54:00,542 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 411 transitions, 8510 flow [2023-09-01 02:54:00,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:00,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:54:00,543 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] [2023-09-01 02:54:00,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-09-01 02:54:00,543 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:54:00,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:54:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash -66814013, now seen corresponding path program 8 times [2023-09-01 02:54:00,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:54:00,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430749302] [2023-09-01 02:54:00,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:54:00,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:54:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:54:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:54:00,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:54:00,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430749302] [2023-09-01 02:54:00,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430749302] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:54:00,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:54:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:54:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677966131] [2023-09-01 02:54:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:54:00,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:54:00,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:54:00,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:54:00,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:54:00,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-09-01 02:54:00,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 411 transitions, 8510 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:00,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:54:00,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-09-01 02:54:00,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:54:11,300 INFO L130 PetriNetUnfolder]: 42085/65879 cut-off events. [2023-09-01 02:54:11,301 INFO L131 PetriNetUnfolder]: For 1335174/1337781 co-relation queries the response was YES. [2023-09-01 02:54:12,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459813 conditions, 65879 events. 42085/65879 cut-off events. For 1335174/1337781 co-relation queries the response was YES. Maximal size of possible extension queue 3713. Compared 551433 event pairs, 8883 based on Foata normal form. 2361/67969 useless extension candidates. Maximal degree in co-relation 459741. Up to 20974 conditions per place. [2023-09-01 02:54:12,204 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 334 selfloop transitions, 159 changer transitions 24/559 dead transitions. [2023-09-01 02:54:12,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 559 transitions, 11756 flow [2023-09-01 02:54:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:54:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:54:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-09-01 02:54:12,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48389513108614235 [2023-09-01 02:54:12,205 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-09-01 02:54:12,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-09-01 02:54:12,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:54:12,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-09-01 02:54:12,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:12,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:12,207 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:12,207 INFO L175 Difference]: Start difference. First operand has 174 places, 411 transitions, 8510 flow. Second operand 5 states and 646 transitions. [2023-09-01 02:54:12,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 559 transitions, 11756 flow [2023-09-01 02:54:24,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 559 transitions, 11658 flow, removed 49 selfloop flow, removed 0 redundant places. [2023-09-01 02:54:24,333 INFO L231 Difference]: Finished difference. Result has 180 places, 415 transitions, 8882 flow [2023-09-01 02:54:24,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=8412, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8882, PETRI_PLACES=180, PETRI_TRANSITIONS=415} [2023-09-01 02:54:24,334 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 125 predicate places. [2023-09-01 02:54:24,334 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 415 transitions, 8882 flow [2023-09-01 02:54:24,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:24,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:54:24,334 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] [2023-09-01 02:54:24,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-09-01 02:54:24,335 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:54:24,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:54:24,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1328780872, now seen corresponding path program 7 times [2023-09-01 02:54:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:54:24,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217527383] [2023-09-01 02:54:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:54:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:54:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:54:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:54:24,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:54:24,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217527383] [2023-09-01 02:54:24,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217527383] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:54:24,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555622026] [2023-09-01 02:54:24,372 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-09-01 02:54:24,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:54:24,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:54:24,375 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:54:24,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-01 02:54:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:54:24,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:54:24,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:54:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:54:24,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:54:24,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:54:24,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555622026] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:54:24,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:54:24,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-09-01 02:54:24,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195591857] [2023-09-01 02:54:24,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:54:24,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 02:54:24,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:54:24,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 02:54:24,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-09-01 02:54:24,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:54:24,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 415 transitions, 8882 flow. Second operand has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:24,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:54:24,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:54:24,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:54:35,203 INFO L130 PetriNetUnfolder]: 41884/64809 cut-off events. [2023-09-01 02:54:35,204 INFO L131 PetriNetUnfolder]: For 1465135/1467569 co-relation queries the response was YES. [2023-09-01 02:54:35,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464145 conditions, 64809 events. 41884/64809 cut-off events. For 1465135/1467569 co-relation queries the response was YES. Maximal size of possible extension queue 3601. Compared 526297 event pairs, 10330 based on Foata normal form. 2684/67136 useless extension candidates. Maximal degree in co-relation 464070. Up to 44601 conditions per place. [2023-09-01 02:54:36,160 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 366 selfloop transitions, 151 changer transitions 13/572 dead transitions. [2023-09-01 02:54:36,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 572 transitions, 12601 flow [2023-09-01 02:54:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:54:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:54:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-09-01 02:54:36,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4764044943820225 [2023-09-01 02:54:36,162 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-09-01 02:54:36,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-09-01 02:54:36,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:54:36,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-09-01 02:54:36,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:36,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:36,164 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:36,164 INFO L175 Difference]: Start difference. First operand has 180 places, 415 transitions, 8882 flow. Second operand 5 states and 636 transitions. [2023-09-01 02:54:36,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 572 transitions, 12601 flow [2023-09-01 02:54:46,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 572 transitions, 12285 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-09-01 02:54:46,973 INFO L231 Difference]: Finished difference. Result has 184 places, 428 transitions, 9325 flow [2023-09-01 02:54:46,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=8582, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9325, PETRI_PLACES=184, PETRI_TRANSITIONS=428} [2023-09-01 02:54:46,974 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 129 predicate places. [2023-09-01 02:54:46,974 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 428 transitions, 9325 flow [2023-09-01 02:54:46,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:46,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:54:46,974 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] [2023-09-01 02:54:46,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-09-01 02:54:47,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-09-01 02:54:47,177 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:54:47,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:54:47,178 INFO L85 PathProgramCache]: Analyzing trace with hash 154314935, now seen corresponding path program 6 times [2023-09-01 02:54:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:54:47,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219855539] [2023-09-01 02:54:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:54:47,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:54:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:54:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:54:47,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:54:47,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219855539] [2023-09-01 02:54:47,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219855539] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:54:47,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:54:47,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:54:47,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944519078] [2023-09-01 02:54:47,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:54:47,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:54:47,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:54:47,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:54:47,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:54:47,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:54:47,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 428 transitions, 9325 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:47,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:54:47,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:54:47,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:54:57,061 INFO L130 PetriNetUnfolder]: 37676/57590 cut-off events. [2023-09-01 02:54:57,061 INFO L131 PetriNetUnfolder]: For 1424177/1429240 co-relation queries the response was YES. [2023-09-01 02:54:57,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428340 conditions, 57590 events. 37676/57590 cut-off events. For 1424177/1429240 co-relation queries the response was YES. Maximal size of possible extension queue 3442. Compared 455859 event pairs, 10673 based on Foata normal form. 3503/59858 useless extension candidates. Maximal degree in co-relation 428263. Up to 24590 conditions per place. [2023-09-01 02:54:57,861 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 413 selfloop transitions, 95 changer transitions 29/597 dead transitions. [2023-09-01 02:54:57,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 597 transitions, 13010 flow [2023-09-01 02:54:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:54:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:54:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-09-01 02:54:57,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883895131086142 [2023-09-01 02:54:57,863 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-09-01 02:54:57,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-09-01 02:54:57,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:54:57,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-09-01 02:54:57,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-09-01 02:54:57,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:57,864 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:54:57,864 INFO L175 Difference]: Start difference. First operand has 184 places, 428 transitions, 9325 flow. Second operand 5 states and 652 transitions. [2023-09-01 02:54:57,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 597 transitions, 13010 flow [2023-09-01 02:55:04,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 597 transitions, 12768 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-09-01 02:55:04,904 INFO L231 Difference]: Finished difference. Result has 187 places, 436 transitions, 9545 flow [2023-09-01 02:55:04,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=9111, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9545, PETRI_PLACES=187, PETRI_TRANSITIONS=436} [2023-09-01 02:55:04,904 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 132 predicate places. [2023-09-01 02:55:04,904 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 436 transitions, 9545 flow [2023-09-01 02:55:04,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:04,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:55:04,905 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] [2023-09-01 02:55:04,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-09-01 02:55:04,905 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:55:04,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:55:04,905 INFO L85 PathProgramCache]: Analyzing trace with hash 339540687, now seen corresponding path program 9 times [2023-09-01 02:55:04,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:55:04,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388109147] [2023-09-01 02:55:04,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:55:04,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:55:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:55:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:55:04,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:55:04,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388109147] [2023-09-01 02:55:04,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388109147] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:55:04,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:55:04,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:55:04,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791548225] [2023-09-01 02:55:04,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:55:04,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:55:04,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:55:04,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:55:04,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:55:04,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:55:04,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 436 transitions, 9545 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:04,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:55:04,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:55:04,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:55:14,748 INFO L130 PetriNetUnfolder]: 36626/56604 cut-off events. [2023-09-01 02:55:14,748 INFO L131 PetriNetUnfolder]: For 1358527/1361703 co-relation queries the response was YES. [2023-09-01 02:55:15,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418200 conditions, 56604 events. 36626/56604 cut-off events. For 1358527/1361703 co-relation queries the response was YES. Maximal size of possible extension queue 3226. Compared 453073 event pairs, 8638 based on Foata normal form. 3065/59304 useless extension candidates. Maximal degree in co-relation 418122. Up to 26205 conditions per place. [2023-09-01 02:55:15,521 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 360 selfloop transitions, 204 changer transitions 37/640 dead transitions. [2023-09-01 02:55:15,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 640 transitions, 14544 flow [2023-09-01 02:55:15,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:55:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:55:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-09-01 02:55:15,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48239700374531835 [2023-09-01 02:55:15,522 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-09-01 02:55:15,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-09-01 02:55:15,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:55:15,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-09-01 02:55:15,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:15,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:15,524 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:15,524 INFO L175 Difference]: Start difference. First operand has 187 places, 436 transitions, 9545 flow. Second operand 5 states and 644 transitions. [2023-09-01 02:55:15,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 640 transitions, 14544 flow [2023-09-01 02:55:24,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 640 transitions, 14232 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-09-01 02:55:24,746 INFO L231 Difference]: Finished difference. Result has 191 places, 495 transitions, 11489 flow [2023-09-01 02:55:24,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=9339, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11489, PETRI_PLACES=191, PETRI_TRANSITIONS=495} [2023-09-01 02:55:24,747 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 136 predicate places. [2023-09-01 02:55:24,747 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 495 transitions, 11489 flow [2023-09-01 02:55:24,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:24,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:55:24,747 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] [2023-09-01 02:55:24,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-09-01 02:55:24,747 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:55:24,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:55:24,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1365040330, now seen corresponding path program 8 times [2023-09-01 02:55:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:55:24,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472422811] [2023-09-01 02:55:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:55:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:55:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:55:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:55:24,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:55:24,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472422811] [2023-09-01 02:55:24,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472422811] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:55:24,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200878096] [2023-09-01 02:55:24,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 02:55:24,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:55:24,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:55:24,785 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:55:24,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-09-01 02:55:24,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:55:24,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:55:24,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:55:24,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:55:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:55:24,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:55:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:55:24,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200878096] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:55:24,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:55:24,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-01 02:55:24,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738059437] [2023-09-01 02:55:24,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:55:24,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:55:24,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:55:24,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:55:24,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:55:24,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:55:24,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 495 transitions, 11489 flow. Second operand has 10 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:24,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:55:24,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:55:24,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:55:35,613 INFO L130 PetriNetUnfolder]: 38085/58383 cut-off events. [2023-09-01 02:55:35,613 INFO L131 PetriNetUnfolder]: For 1459002/1462246 co-relation queries the response was YES. [2023-09-01 02:55:36,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443459 conditions, 58383 events. 38085/58383 cut-off events. For 1459002/1462246 co-relation queries the response was YES. Maximal size of possible extension queue 3302. Compared 460761 event pairs, 7399 based on Foata normal form. 3015/60989 useless extension candidates. Maximal degree in co-relation 443378. Up to 25881 conditions per place. [2023-09-01 02:55:36,478 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 494 selfloop transitions, 224 changer transitions 40/797 dead transitions. [2023-09-01 02:55:36,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 797 transitions, 18278 flow [2023-09-01 02:55:36,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:55:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:55:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1017 transitions. [2023-09-01 02:55:36,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.476123595505618 [2023-09-01 02:55:36,479 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1017 transitions. [2023-09-01 02:55:36,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1017 transitions. [2023-09-01 02:55:36,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:55:36,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1017 transitions. [2023-09-01 02:55:36,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:36,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:36,482 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:36,482 INFO L175 Difference]: Start difference. First operand has 191 places, 495 transitions, 11489 flow. Second operand 8 states and 1017 transitions. [2023-09-01 02:55:36,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 797 transitions, 18278 flow [2023-09-01 02:55:48,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 797 transitions, 17880 flow, removed 115 selfloop flow, removed 1 redundant places. [2023-09-01 02:55:48,089 INFO L231 Difference]: Finished difference. Result has 199 places, 512 transitions, 12023 flow [2023-09-01 02:55:48,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=11091, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=207, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12023, PETRI_PLACES=199, PETRI_TRANSITIONS=512} [2023-09-01 02:55:48,090 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 144 predicate places. [2023-09-01 02:55:48,090 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 512 transitions, 12023 flow [2023-09-01 02:55:48,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:48,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:55:48,090 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] [2023-09-01 02:55:48,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-09-01 02:55:48,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-09-01 02:55:48,291 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:55:48,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:55:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash 753687983, now seen corresponding path program 10 times [2023-09-01 02:55:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:55:48,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132782964] [2023-09-01 02:55:48,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:55:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:55:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:55:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:55:48,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:55:48,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132782964] [2023-09-01 02:55:48,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132782964] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:55:48,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:55:48,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:55:48,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562391173] [2023-09-01 02:55:48,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:55:48,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:55:48,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:55:48,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:55:48,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:55:48,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:55:48,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 512 transitions, 12023 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:48,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:55:48,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:55:48,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:55:58,931 INFO L130 PetriNetUnfolder]: 37323/57241 cut-off events. [2023-09-01 02:55:58,931 INFO L131 PetriNetUnfolder]: For 1510642/1515530 co-relation queries the response was YES. [2023-09-01 02:55:59,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434279 conditions, 57241 events. 37323/57241 cut-off events. For 1510642/1515530 co-relation queries the response was YES. Maximal size of possible extension queue 3298. Compared 454740 event pairs, 8774 based on Foata normal form. 3254/59886 useless extension candidates. Maximal degree in co-relation 434196. Up to 22809 conditions per place. [2023-09-01 02:55:59,894 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 458 selfloop transitions, 183 changer transitions 72/769 dead transitions. [2023-09-01 02:55:59,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 769 transitions, 18118 flow [2023-09-01 02:55:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:55:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:55:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2023-09-01 02:55:59,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4762796504369538 [2023-09-01 02:55:59,895 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2023-09-01 02:55:59,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2023-09-01 02:55:59,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:55:59,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2023-09-01 02:55:59,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:59,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:59,898 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:55:59,898 INFO L175 Difference]: Start difference. First operand has 199 places, 512 transitions, 12023 flow. Second operand 6 states and 763 transitions. [2023-09-01 02:55:59,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 769 transitions, 18118 flow [2023-09-01 02:56:11,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 769 transitions, 17548 flow, removed 43 selfloop flow, removed 5 redundant places. [2023-09-01 02:56:11,551 INFO L231 Difference]: Finished difference. Result has 203 places, 578 transitions, 13692 flow [2023-09-01 02:56:11,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=11539, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13692, PETRI_PLACES=203, PETRI_TRANSITIONS=578} [2023-09-01 02:56:11,552 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 148 predicate places. [2023-09-01 02:56:11,552 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 578 transitions, 13692 flow [2023-09-01 02:56:11,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:56:11,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:56:11,552 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] [2023-09-01 02:56:11,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-09-01 02:56:11,552 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:56:11,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:56:11,553 INFO L85 PathProgramCache]: Analyzing trace with hash 780929349, now seen corresponding path program 11 times [2023-09-01 02:56:11,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:56:11,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424531815] [2023-09-01 02:56:11,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:56:11,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:56:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:56:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:56:11,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:56:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424531815] [2023-09-01 02:56:11,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424531815] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:56:11,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:56:11,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:56:11,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826340086] [2023-09-01 02:56:11,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:56:11,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:56:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:56:11,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:56:11,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:56:11,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:56:11,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 578 transitions, 13692 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:56:11,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:56:11,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:56:11,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:56:23,771 INFO L130 PetriNetUnfolder]: 37664/57098 cut-off events. [2023-09-01 02:56:23,771 INFO L131 PetriNetUnfolder]: For 1600579/1603822 co-relation queries the response was YES. [2023-09-01 02:56:24,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451549 conditions, 57098 events. 37664/57098 cut-off events. For 1600579/1603822 co-relation queries the response was YES. Maximal size of possible extension queue 3217. Compared 440946 event pairs, 11026 based on Foata normal form. 2381/58844 useless extension candidates. Maximal degree in co-relation 451462. Up to 27492 conditions per place. [2023-09-01 02:56:24,846 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 515 selfloop transitions, 159 changer transitions 26/756 dead transitions. [2023-09-01 02:56:24,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 756 transitions, 18493 flow [2023-09-01 02:56:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:56:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:56:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-09-01 02:56:24,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48089887640449436 [2023-09-01 02:56:24,847 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-09-01 02:56:24,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-09-01 02:56:24,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:56:24,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-09-01 02:56:24,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:56:24,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:56:24,849 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:56:24,849 INFO L175 Difference]: Start difference. First operand has 203 places, 578 transitions, 13692 flow. Second operand 5 states and 642 transitions. [2023-09-01 02:56:24,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 756 transitions, 18493 flow [2023-09-01 02:56:36,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 756 transitions, 18271 flow, removed 111 selfloop flow, removed 0 redundant places. [2023-09-01 02:56:36,904 INFO L231 Difference]: Finished difference. Result has 208 places, 598 transitions, 14351 flow [2023-09-01 02:56:36,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=13502, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14351, PETRI_PLACES=208, PETRI_TRANSITIONS=598} [2023-09-01 02:56:36,904 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 153 predicate places. [2023-09-01 02:56:36,904 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 598 transitions, 14351 flow [2023-09-01 02:56:36,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:56:36,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:56:36,905 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] [2023-09-01 02:56:36,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-09-01 02:56:36,905 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:56:36,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:56:36,905 INFO L85 PathProgramCache]: Analyzing trace with hash 34021147, now seen corresponding path program 12 times [2023-09-01 02:56:36,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:56:36,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730438962] [2023-09-01 02:56:36,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:56:36,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:56:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:56:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:56:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:56:36,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730438962] [2023-09-01 02:56:36,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730438962] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:56:36,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:56:36,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:56:36,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252860496] [2023-09-01 02:56:36,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:56:36,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:56:36,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:56:36,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:56:36,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:56:36,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:56:36,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 598 transitions, 14351 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:56:36,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:56:36,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:56:36,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:56:49,693 INFO L130 PetriNetUnfolder]: 40033/60338 cut-off events. [2023-09-01 02:56:49,693 INFO L131 PetriNetUnfolder]: For 1706625/1709374 co-relation queries the response was YES. [2023-09-01 02:56:50,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482882 conditions, 60338 events. 40033/60338 cut-off events. For 1706625/1709374 co-relation queries the response was YES. Maximal size of possible extension queue 3352. Compared 462894 event pairs, 10850 based on Foata normal form. 2132/61937 useless extension candidates. Maximal degree in co-relation 482793. Up to 23580 conditions per place. [2023-09-01 02:56:50,772 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 483 selfloop transitions, 219 changer transitions 24/770 dead transitions. [2023-09-01 02:56:50,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 770 transitions, 19093 flow [2023-09-01 02:56:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:56:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:56:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-09-01 02:56:50,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48089887640449436 [2023-09-01 02:56:50,773 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-09-01 02:56:50,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-09-01 02:56:50,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:56:50,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-09-01 02:56:50,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:56:50,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:56:50,775 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:56:50,775 INFO L175 Difference]: Start difference. First operand has 208 places, 598 transitions, 14351 flow. Second operand 5 states and 642 transitions. [2023-09-01 02:56:50,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 770 transitions, 19093 flow [2023-09-01 02:57:04,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 770 transitions, 18679 flow, removed 26 selfloop flow, removed 3 redundant places. [2023-09-01 02:57:04,142 INFO L231 Difference]: Finished difference. Result has 210 places, 626 transitions, 15244 flow [2023-09-01 02:57:04,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=13987, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15244, PETRI_PLACES=210, PETRI_TRANSITIONS=626} [2023-09-01 02:57:04,143 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 155 predicate places. [2023-09-01 02:57:04,143 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 626 transitions, 15244 flow [2023-09-01 02:57:04,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:57:04,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:57:04,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] [2023-09-01 02:57:04,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-09-01 02:57:04,144 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:57:04,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:57:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1102447902, now seen corresponding path program 9 times [2023-09-01 02:57:04,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:57:04,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698264298] [2023-09-01 02:57:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:57:04,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:57:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:57:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:57:04,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:57:04,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698264298] [2023-09-01 02:57:04,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698264298] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:57:04,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706839179] [2023-09-01 02:57:04,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 02:57:04,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:57:04,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:57:04,182 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:57:04,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-09-01 02:57:04,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 02:57:04,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:57:04,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:57:04,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:57:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:57:04,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:57:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:57:04,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706839179] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:57:04,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:57:04,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-01 02:57:04,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309080185] [2023-09-01 02:57:04,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:57:04,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:57:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:57:04,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:57:04,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:57:04,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:57:04,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 626 transitions, 15244 flow. Second operand has 10 states, 10 states have (on average 115.3) internal successors, (1153), 10 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:57:04,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:57:04,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:57:04,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:57:16,351 INFO L130 PetriNetUnfolder]: 38509/58104 cut-off events. [2023-09-01 02:57:16,351 INFO L131 PetriNetUnfolder]: For 1720360/1723990 co-relation queries the response was YES. [2023-09-01 02:57:17,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469495 conditions, 58104 events. 38509/58104 cut-off events. For 1720360/1723990 co-relation queries the response was YES. Maximal size of possible extension queue 3242. Compared 445906 event pairs, 12061 based on Foata normal form. 2643/60287 useless extension candidates. Maximal degree in co-relation 469405. Up to 28512 conditions per place. [2023-09-01 02:57:17,567 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 525 selfloop transitions, 171 changer transitions 37/773 dead transitions. [2023-09-01 02:57:17,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 773 transitions, 19388 flow [2023-09-01 02:57:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:57:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:57:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-09-01 02:57:17,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4771535580524345 [2023-09-01 02:57:17,568 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-09-01 02:57:17,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-09-01 02:57:17,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:57:17,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-09-01 02:57:17,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:57:17,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:57:17,571 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:57:17,571 INFO L175 Difference]: Start difference. First operand has 210 places, 626 transitions, 15244 flow. Second operand 5 states and 637 transitions. [2023-09-01 02:57:17,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 773 transitions, 19388 flow [2023-09-01 02:57:30,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 773 transitions, 18810 flow, removed 70 selfloop flow, removed 3 redundant places. [2023-09-01 02:57:30,303 INFO L231 Difference]: Finished difference. Result has 212 places, 617 transitions, 14932 flow [2023-09-01 02:57:30,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14666, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14932, PETRI_PLACES=212, PETRI_TRANSITIONS=617} [2023-09-01 02:57:30,304 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 157 predicate places. [2023-09-01 02:57:30,304 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 617 transitions, 14932 flow [2023-09-01 02:57:30,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.3) internal successors, (1153), 10 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:57:30,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:57:30,305 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] [2023-09-01 02:57:30,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-09-01 02:57:30,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-09-01 02:57:30,508 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:57:30,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:57:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash -462565781, now seen corresponding path program 13 times [2023-09-01 02:57:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:57:30,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734525832] [2023-09-01 02:57:30,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:57:30,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:57:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:57:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:57:30,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:57:30,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734525832] [2023-09-01 02:57:30,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734525832] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:57:30,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:57:30,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:57:30,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699648913] [2023-09-01 02:57:30,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:57:30,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:57:30,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:57:30,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:57:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:57:30,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:57:30,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 617 transitions, 14932 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:57:30,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:57:30,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:57:30,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:57:41,170 INFO L130 PetriNetUnfolder]: 34574/51530 cut-off events. [2023-09-01 02:57:41,171 INFO L131 PetriNetUnfolder]: For 1515816/1519201 co-relation queries the response was YES. [2023-09-01 02:57:41,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416848 conditions, 51530 events. 34574/51530 cut-off events. For 1515816/1519201 co-relation queries the response was YES. Maximal size of possible extension queue 2827. Compared 380596 event pairs, 9808 based on Foata normal form. 2459/53559 useless extension candidates. Maximal degree in co-relation 416757. Up to 21361 conditions per place. [2023-09-01 02:57:41,969 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 511 selfloop transitions, 199 changer transitions 27/771 dead transitions. [2023-09-01 02:57:41,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 771 transitions, 19281 flow [2023-09-01 02:57:41,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:57:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:57:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-09-01 02:57:41,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794007490636704 [2023-09-01 02:57:41,970 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-09-01 02:57:41,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-09-01 02:57:41,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:57:41,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-09-01 02:57:41,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:57:41,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:57:41,972 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:57:41,973 INFO L175 Difference]: Start difference. First operand has 212 places, 617 transitions, 14932 flow. Second operand 5 states and 640 transitions. [2023-09-01 02:57:41,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 771 transitions, 19281 flow [2023-09-01 02:57:52,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 771 transitions, 18907 flow, removed 93 selfloop flow, removed 2 redundant places. [2023-09-01 02:57:52,945 INFO L231 Difference]: Finished difference. Result has 215 places, 624 transitions, 15327 flow [2023-09-01 02:57:52,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14560, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15327, PETRI_PLACES=215, PETRI_TRANSITIONS=624} [2023-09-01 02:57:52,946 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 160 predicate places. [2023-09-01 02:57:52,947 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 624 transitions, 15327 flow [2023-09-01 02:57:52,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:57:52,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:57:52,947 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] [2023-09-01 02:57:52,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-09-01 02:57:52,947 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:57:52,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:57:52,948 INFO L85 PathProgramCache]: Analyzing trace with hash -482494160, now seen corresponding path program 6 times [2023-09-01 02:57:52,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:57:52,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628536353] [2023-09-01 02:57:52,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:57:52,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:57:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:57:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:57:52,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:57:52,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628536353] [2023-09-01 02:57:52,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628536353] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:57:52,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141404578] [2023-09-01 02:57:52,987 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 02:57:52,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:57:52,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:57:52,988 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:57:52,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-09-01 02:57:53,103 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-09-01 02:57:53,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:57:53,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:57:53,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:57:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:57:53,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:57:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:57:53,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141404578] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:57:53,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:57:53,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-01 02:57:53,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297740405] [2023-09-01 02:57:53,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:57:53,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:57:53,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:57:53,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:57:53,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:57:53,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:57:53,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 624 transitions, 15327 flow. Second operand has 10 states, 10 states have (on average 116.5) internal successors, (1165), 10 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:57:53,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:57:53,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:57:53,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:58:03,133 INFO L130 PetriNetUnfolder]: 33421/48947 cut-off events. [2023-09-01 02:58:03,133 INFO L131 PetriNetUnfolder]: For 1457129/1463548 co-relation queries the response was YES. [2023-09-01 02:58:03,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400215 conditions, 48947 events. 33421/48947 cut-off events. For 1457129/1463548 co-relation queries the response was YES. Maximal size of possible extension queue 2809. Compared 351292 event pairs, 6188 based on Foata normal form. 3935/51900 useless extension candidates. Maximal degree in co-relation 400123. Up to 20731 conditions per place. [2023-09-01 02:58:04,099 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 707 selfloop transitions, 162 changer transitions 87/1017 dead transitions. [2023-09-01 02:58:04,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 1017 transitions, 25390 flow [2023-09-01 02:58:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:58:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:58:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1025 transitions. [2023-09-01 02:58:04,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798689138576779 [2023-09-01 02:58:04,101 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1025 transitions. [2023-09-01 02:58:04,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1025 transitions. [2023-09-01 02:58:04,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:58:04,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1025 transitions. [2023-09-01 02:58:04,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.125) internal successors, (1025), 8 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:04,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:04,103 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:04,104 INFO L175 Difference]: Start difference. First operand has 215 places, 624 transitions, 15327 flow. Second operand 8 states and 1025 transitions. [2023-09-01 02:58:04,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 1017 transitions, 25390 flow [2023-09-01 02:58:12,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1017 transitions, 24188 flow, removed 153 selfloop flow, removed 5 redundant places. [2023-09-01 02:58:12,122 INFO L231 Difference]: Finished difference. Result has 218 places, 646 transitions, 15535 flow [2023-09-01 02:58:12,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14565, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15535, PETRI_PLACES=218, PETRI_TRANSITIONS=646} [2023-09-01 02:58:12,123 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 163 predicate places. [2023-09-01 02:58:12,123 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 646 transitions, 15535 flow [2023-09-01 02:58:12,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 116.5) internal successors, (1165), 10 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:12,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:58:12,123 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] [2023-09-01 02:58:12,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-09-01 02:58:12,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-09-01 02:58:12,324 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:58:12,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:58:12,324 INFO L85 PathProgramCache]: Analyzing trace with hash -413986243, now seen corresponding path program 7 times [2023-09-01 02:58:12,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:58:12,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417265760] [2023-09-01 02:58:12,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:58:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:58:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:58:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:58:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:58:12,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417265760] [2023-09-01 02:58:12,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417265760] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:58:12,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:58:12,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:58:12,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496460681] [2023-09-01 02:58:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:58:12,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:58:12,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:58:12,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:58:12,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:58:12,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:58:12,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 646 transitions, 15535 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:12,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:58:12,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:58:12,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:58:21,431 INFO L130 PetriNetUnfolder]: 31341/45428 cut-off events. [2023-09-01 02:58:21,431 INFO L131 PetriNetUnfolder]: For 1287985/1291702 co-relation queries the response was YES. [2023-09-01 02:58:22,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378761 conditions, 45428 events. 31341/45428 cut-off events. For 1287985/1291702 co-relation queries the response was YES. Maximal size of possible extension queue 2470. Compared 314667 event pairs, 8008 based on Foata normal form. 3149/47721 useless extension candidates. Maximal degree in co-relation 378668. Up to 25755 conditions per place. [2023-09-01 02:58:22,368 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 512 selfloop transitions, 193 changer transitions 89/831 dead transitions. [2023-09-01 02:58:22,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 831 transitions, 20521 flow [2023-09-01 02:58:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:58:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:58:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2023-09-01 02:58:22,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48252184769038703 [2023-09-01 02:58:22,369 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2023-09-01 02:58:22,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2023-09-01 02:58:22,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:58:22,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2023-09-01 02:58:22,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:22,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:22,371 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:22,371 INFO L175 Difference]: Start difference. First operand has 218 places, 646 transitions, 15535 flow. Second operand 6 states and 773 transitions. [2023-09-01 02:58:22,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 831 transitions, 20521 flow [2023-09-01 02:58:29,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 831 transitions, 19980 flow, removed 96 selfloop flow, removed 7 redundant places. [2023-09-01 02:58:29,867 INFO L231 Difference]: Finished difference. Result has 217 places, 640 transitions, 15347 flow [2023-09-01 02:58:29,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=15050, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=15347, PETRI_PLACES=217, PETRI_TRANSITIONS=640} [2023-09-01 02:58:29,868 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 162 predicate places. [2023-09-01 02:58:29,868 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 640 transitions, 15347 flow [2023-09-01 02:58:29,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:29,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:58:29,868 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] [2023-09-01 02:58:29,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-09-01 02:58:29,868 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:58:29,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:58:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1838366115, now seen corresponding path program 8 times [2023-09-01 02:58:29,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:58:29,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148788649] [2023-09-01 02:58:29,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:58:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:58:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:58:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:58:29,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:58:29,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148788649] [2023-09-01 02:58:29,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148788649] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:58:29,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044719624] [2023-09-01 02:58:29,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 02:58:29,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:58:29,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:58:29,905 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:58:29,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-09-01 02:58:30,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:58:30,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:58:30,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:58:30,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:58:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:58:30,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:58:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:58:30,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044719624] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:58:30,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:58:30,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-01 02:58:30,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200077176] [2023-09-01 02:58:30,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:58:30,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:58:30,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:58:30,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:58:30,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:58:30,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:58:30,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 640 transitions, 15347 flow. Second operand has 10 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:30,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:58:30,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:58:30,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:58:39,506 INFO L130 PetriNetUnfolder]: 33169/47217 cut-off events. [2023-09-01 02:58:39,506 INFO L131 PetriNetUnfolder]: For 1290611/1293488 co-relation queries the response was YES. [2023-09-01 02:58:40,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392965 conditions, 47217 events. 33169/47217 cut-off events. For 1290611/1293488 co-relation queries the response was YES. Maximal size of possible extension queue 2490. Compared 315649 event pairs, 4130 based on Foata normal form. 2540/49047 useless extension candidates. Maximal degree in co-relation 392873. Up to 22065 conditions per place. [2023-09-01 02:58:40,296 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 602 selfloop transitions, 250 changer transitions 113/1010 dead transitions. [2023-09-01 02:58:40,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 1010 transitions, 24591 flow [2023-09-01 02:58:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:58:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:58:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1019 transitions. [2023-09-01 02:58:40,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477059925093633 [2023-09-01 02:58:40,298 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1019 transitions. [2023-09-01 02:58:40,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1019 transitions. [2023-09-01 02:58:40,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:58:40,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1019 transitions. [2023-09-01 02:58:40,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.375) internal successors, (1019), 8 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:40,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:40,300 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:40,301 INFO L175 Difference]: Start difference. First operand has 217 places, 640 transitions, 15347 flow. Second operand 8 states and 1019 transitions. [2023-09-01 02:58:40,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 1010 transitions, 24591 flow [2023-09-01 02:58:47,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1010 transitions, 23855 flow, removed 85 selfloop flow, removed 7 redundant places. [2023-09-01 02:58:47,708 INFO L231 Difference]: Finished difference. Result has 218 places, 675 transitions, 16245 flow [2023-09-01 02:58:47,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14670, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16245, PETRI_PLACES=218, PETRI_TRANSITIONS=675} [2023-09-01 02:58:47,709 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 163 predicate places. [2023-09-01 02:58:47,709 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 675 transitions, 16245 flow [2023-09-01 02:58:47,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:47,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:58:47,709 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] [2023-09-01 02:58:47,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-09-01 02:58:47,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-09-01 02:58:47,910 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:58:47,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:58:47,910 INFO L85 PathProgramCache]: Analyzing trace with hash 610739002, now seen corresponding path program 7 times [2023-09-01 02:58:47,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:58:47,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443944301] [2023-09-01 02:58:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:58:47,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:58:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:58:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:58:47,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:58:47,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443944301] [2023-09-01 02:58:47,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443944301] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:58:47,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:58:47,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:58:47,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839475993] [2023-09-01 02:58:47,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:58:47,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:58:47,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:58:47,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:58:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:58:47,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-09-01 02:58:47,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 675 transitions, 16245 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:47,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:58:47,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-09-01 02:58:47,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:58:55,871 INFO L130 PetriNetUnfolder]: 29985/41321 cut-off events. [2023-09-01 02:58:55,871 INFO L131 PetriNetUnfolder]: For 1173263/1178687 co-relation queries the response was YES. [2023-09-01 02:58:56,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356087 conditions, 41321 events. 29985/41321 cut-off events. For 1173263/1178687 co-relation queries the response was YES. Maximal size of possible extension queue 2249. Compared 254754 event pairs, 7920 based on Foata normal form. 3494/43748 useless extension candidates. Maximal degree in co-relation 355995. Up to 27710 conditions per place. [2023-09-01 02:58:56,545 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 510 selfloop transitions, 166 changer transitions 85/809 dead transitions. [2023-09-01 02:58:56,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 809 transitions, 20086 flow [2023-09-01 02:58:56,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:58:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:58:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-09-01 02:58:56,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853932584269663 [2023-09-01 02:58:56,546 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-09-01 02:58:56,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-09-01 02:58:56,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:58:56,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-09-01 02:58:56,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:56,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:56,548 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:58:56,548 INFO L175 Difference]: Start difference. First operand has 218 places, 675 transitions, 16245 flow. Second operand 5 states and 648 transitions. [2023-09-01 02:58:56,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 809 transitions, 20086 flow [2023-09-01 02:59:02,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 809 transitions, 19257 flow, removed 180 selfloop flow, removed 8 redundant places. [2023-09-01 02:59:02,583 INFO L231 Difference]: Finished difference. Result has 213 places, 652 transitions, 15289 flow [2023-09-01 02:59:02,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=15418, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15289, PETRI_PLACES=213, PETRI_TRANSITIONS=652} [2023-09-01 02:59:02,584 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 158 predicate places. [2023-09-01 02:59:02,584 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 652 transitions, 15289 flow [2023-09-01 02:59:02,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:02,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:59:02,584 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] [2023-09-01 02:59:02,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-09-01 02:59:02,584 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:59:02,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:59:02,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1884746823, now seen corresponding path program 9 times [2023-09-01 02:59:02,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:59:02,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931567214] [2023-09-01 02:59:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:59:02,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:59:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:59:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:59:02,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:59:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931567214] [2023-09-01 02:59:02,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931567214] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:59:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936309267] [2023-09-01 02:59:02,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 02:59:02,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:59:02,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:59:02,623 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:59:02,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-09-01 02:59:02,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 02:59:02,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:59:02,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:59:02,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:59:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:59:02,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:59:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:59:02,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936309267] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:59:02,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:59:02,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-01 02:59:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391701250] [2023-09-01 02:59:02,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:59:02,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:59:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:59:02,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:59:02,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:59:02,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:59:02,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 652 transitions, 15289 flow. Second operand has 10 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:02,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:59:02,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:59:02,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:59:09,501 INFO L130 PetriNetUnfolder]: 27154/36707 cut-off events. [2023-09-01 02:59:09,501 INFO L131 PetriNetUnfolder]: For 984772/988951 co-relation queries the response was YES. [2023-09-01 02:59:10,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314052 conditions, 36707 events. 27154/36707 cut-off events. For 984772/988951 co-relation queries the response was YES. Maximal size of possible extension queue 1811. Compared 210951 event pairs, 6363 based on Foata normal form. 2904/38976 useless extension candidates. Maximal degree in co-relation 313962. Up to 22230 conditions per place. [2023-09-01 02:59:10,199 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 464 selfloop transitions, 214 changer transitions 46/764 dead transitions. [2023-09-01 02:59:10,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 764 transitions, 18795 flow [2023-09-01 02:59:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:59:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:59:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-09-01 02:59:10,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696629213483146 [2023-09-01 02:59:10,201 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-09-01 02:59:10,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-09-01 02:59:10,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:59:10,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-09-01 02:59:10,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:10,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:10,202 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:10,202 INFO L175 Difference]: Start difference. First operand has 213 places, 652 transitions, 15289 flow. Second operand 5 states and 627 transitions. [2023-09-01 02:59:10,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 764 transitions, 18795 flow [2023-09-01 02:59:14,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 764 transitions, 18151 flow, removed 154 selfloop flow, removed 5 redundant places. [2023-09-01 02:59:14,949 INFO L231 Difference]: Finished difference. Result has 205 places, 636 transitions, 14768 flow [2023-09-01 02:59:14,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14647, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14768, PETRI_PLACES=205, PETRI_TRANSITIONS=636} [2023-09-01 02:59:14,950 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 150 predicate places. [2023-09-01 02:59:14,950 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 636 transitions, 14768 flow [2023-09-01 02:59:14,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:14,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:59:14,951 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] [2023-09-01 02:59:14,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-09-01 02:59:15,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-09-01 02:59:15,152 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:59:15,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:59:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1942890753, now seen corresponding path program 1 times [2023-09-01 02:59:15,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:59:15,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824612124] [2023-09-01 02:59:15,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:59:15,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:59:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:59:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:59:15,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:59:15,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824612124] [2023-09-01 02:59:15,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824612124] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:59:15,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:59:15,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:59:15,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406716210] [2023-09-01 02:59:15,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:59:15,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:59:15,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:59:15,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:59:15,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:59:15,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-09-01 02:59:15,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 636 transitions, 14768 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:15,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:59:15,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-09-01 02:59:15,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:59:20,894 INFO L130 PetriNetUnfolder]: 26246/34565 cut-off events. [2023-09-01 02:59:20,894 INFO L131 PetriNetUnfolder]: For 820298/823456 co-relation queries the response was YES. [2023-09-01 02:59:21,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301455 conditions, 34565 events. 26246/34565 cut-off events. For 820298/823456 co-relation queries the response was YES. Maximal size of possible extension queue 1607. Compared 183788 event pairs, 2422 based on Foata normal form. 1677/35636 useless extension candidates. Maximal degree in co-relation 301367. Up to 20444 conditions per place. [2023-09-01 02:59:21,524 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 513 selfloop transitions, 211 changer transitions 8/772 dead transitions. [2023-09-01 02:59:21,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 772 transitions, 18554 flow [2023-09-01 02:59:21,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:59:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:59:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-09-01 02:59:21,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4771535580524345 [2023-09-01 02:59:21,525 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-09-01 02:59:21,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-09-01 02:59:21,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:59:21,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-09-01 02:59:21,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:21,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:21,527 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:21,527 INFO L175 Difference]: Start difference. First operand has 205 places, 636 transitions, 14768 flow. Second operand 5 states and 637 transitions. [2023-09-01 02:59:21,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 772 transitions, 18554 flow [2023-09-01 02:59:26,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 772 transitions, 17258 flow, removed 197 selfloop flow, removed 21 redundant places. [2023-09-01 02:59:26,071 INFO L231 Difference]: Finished difference. Result has 178 places, 673 transitions, 15036 flow [2023-09-01 02:59:26,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=13524, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15036, PETRI_PLACES=178, PETRI_TRANSITIONS=673} [2023-09-01 02:59:26,072 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 123 predicate places. [2023-09-01 02:59:26,072 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 673 transitions, 15036 flow [2023-09-01 02:59:26,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:26,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:59:26,072 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] [2023-09-01 02:59:26,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-09-01 02:59:26,072 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:59:26,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:59:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1923507149, now seen corresponding path program 2 times [2023-09-01 02:59:26,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:59:26,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113887882] [2023-09-01 02:59:26,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:59:26,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:59:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:59:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 02:59:26,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:59:26,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113887882] [2023-09-01 02:59:26,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113887882] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:59:26,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668142577] [2023-09-01 02:59:26,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 02:59:26,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:59:26,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:59:26,110 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:59:26,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-09-01 02:59:26,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:59:26,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:59:26,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:59:26,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:59:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 02:59:26,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:59:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 02:59:26,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668142577] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:59:26,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:59:26,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-01 02:59:26,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165322957] [2023-09-01 02:59:26,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:59:26,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:59:26,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:59:26,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:59:26,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:59:26,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:59:26,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 673 transitions, 15036 flow. Second operand has 10 states, 10 states have (on average 116.1) internal successors, (1161), 10 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:26,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:59:26,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:59:26,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:59:32,887 INFO L130 PetriNetUnfolder]: 31512/41502 cut-off events. [2023-09-01 02:59:32,887 INFO L131 PetriNetUnfolder]: For 911585/914118 co-relation queries the response was YES. [2023-09-01 02:59:33,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348096 conditions, 41502 events. 31512/41502 cut-off events. For 911585/914118 co-relation queries the response was YES. Maximal size of possible extension queue 1913. Compared 225847 event pairs, 2722 based on Foata normal form. 1644/42223 useless extension candidates. Maximal degree in co-relation 348023. Up to 24492 conditions per place. [2023-09-01 02:59:33,604 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 534 selfloop transitions, 367 changer transitions 12/944 dead transitions. [2023-09-01 02:59:33,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 944 transitions, 21889 flow [2023-09-01 02:59:33,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:59:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:59:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-09-01 02:59:33,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681647940074906 [2023-09-01 02:59:33,605 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-09-01 02:59:33,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-09-01 02:59:33,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:59:33,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-09-01 02:59:33,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:33,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:33,608 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:33,608 INFO L175 Difference]: Start difference. First operand has 178 places, 673 transitions, 15036 flow. Second operand 8 states and 1000 transitions. [2023-09-01 02:59:33,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 944 transitions, 21889 flow [2023-09-01 02:59:38,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 944 transitions, 21645 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-09-01 02:59:38,694 INFO L231 Difference]: Finished difference. Result has 185 places, 745 transitions, 17457 flow [2023-09-01 02:59:38,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14836, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17457, PETRI_PLACES=185, PETRI_TRANSITIONS=745} [2023-09-01 02:59:38,694 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 130 predicate places. [2023-09-01 02:59:38,695 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 745 transitions, 17457 flow [2023-09-01 02:59:38,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 116.1) internal successors, (1161), 10 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:38,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:59:38,695 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] [2023-09-01 02:59:38,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-09-01 02:59:38,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:59:38,900 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:59:38,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:59:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash -898022775, now seen corresponding path program 3 times [2023-09-01 02:59:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:59:38,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689025523] [2023-09-01 02:59:38,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:59:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:59:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:59:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 02:59:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:59:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689025523] [2023-09-01 02:59:38,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689025523] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:59:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172286746] [2023-09-01 02:59:38,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 02:59:38,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:59:38,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:59:38,941 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:59:38,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-09-01 02:59:39,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 02:59:39,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:59:39,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:59:39,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:59:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 02:59:39,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:59:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 02:59:39,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172286746] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:59:39,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:59:39,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-01 02:59:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61028479] [2023-09-01 02:59:39,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:59:39,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:59:39,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:59:39,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:59:39,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:59:39,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:59:39,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 745 transitions, 17457 flow. Second operand has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:39,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:59:39,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:59:39,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:59:46,751 INFO L130 PetriNetUnfolder]: 34188/44924 cut-off events. [2023-09-01 02:59:46,752 INFO L131 PetriNetUnfolder]: For 1062301/1066242 co-relation queries the response was YES. [2023-09-01 02:59:47,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389296 conditions, 44924 events. 34188/44924 cut-off events. For 1062301/1066242 co-relation queries the response was YES. Maximal size of possible extension queue 1999. Compared 246490 event pairs, 2948 based on Foata normal form. 2439/46790 useless extension candidates. Maximal degree in co-relation 389221. Up to 26495 conditions per place. [2023-09-01 02:59:47,494 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 575 selfloop transitions, 364 changer transitions 15/993 dead transitions. [2023-09-01 02:59:47,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 993 transitions, 24105 flow [2023-09-01 02:59:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:59:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:59:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 992 transitions. [2023-09-01 02:59:47,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46441947565543074 [2023-09-01 02:59:47,495 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 992 transitions. [2023-09-01 02:59:47,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 992 transitions. [2023-09-01 02:59:47,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:59:47,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 992 transitions. [2023-09-01 02:59:47,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:47,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:47,498 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:47,498 INFO L175 Difference]: Start difference. First operand has 185 places, 745 transitions, 17457 flow. Second operand 8 states and 992 transitions. [2023-09-01 02:59:47,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 993 transitions, 24105 flow [2023-09-01 02:59:54,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 993 transitions, 23071 flow, removed 98 selfloop flow, removed 5 redundant places. [2023-09-01 02:59:54,589 INFO L231 Difference]: Finished difference. Result has 189 places, 818 transitions, 19411 flow [2023-09-01 02:59:54,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=16657, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=285, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=19411, PETRI_PLACES=189, PETRI_TRANSITIONS=818} [2023-09-01 02:59:54,590 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 134 predicate places. [2023-09-01 02:59:54,590 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 818 transitions, 19411 flow [2023-09-01 02:59:54,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:54,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:59:54,591 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] [2023-09-01 02:59:54,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-09-01 02:59:54,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:59:54,799 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 02:59:54,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:59:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1929965688, now seen corresponding path program 1 times [2023-09-01 02:59:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:59:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107962714] [2023-09-01 02:59:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:59:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:59:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:59:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 02:59:54,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:59:54,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107962714] [2023-09-01 02:59:54,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107962714] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:59:54,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128874356] [2023-09-01 02:59:54,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:59:54,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:59:54,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:59:54,853 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:59:54,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-09-01 02:59:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:59:54,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 02:59:54,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:59:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 02:59:55,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:59:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 02:59:55,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128874356] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:59:55,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:59:55,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-01 02:59:55,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459638109] [2023-09-01 02:59:55,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:59:55,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:59:55,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:59:55,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:59:55,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:59:55,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 02:59:55,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 818 transitions, 19411 flow. Second operand has 10 states, 10 states have (on average 117.1) internal successors, (1171), 10 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:59:55,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:59:55,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 02:59:55,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 03:00:03,073 INFO L130 PetriNetUnfolder]: 33951/44117 cut-off events. [2023-09-01 03:00:03,073 INFO L131 PetriNetUnfolder]: For 1053398/1057366 co-relation queries the response was YES. [2023-09-01 03:00:03,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394302 conditions, 44117 events. 33951/44117 cut-off events. For 1053398/1057366 co-relation queries the response was YES. Maximal size of possible extension queue 2026. Compared 235083 event pairs, 4008 based on Foata normal form. 1691/44743 useless extension candidates. Maximal degree in co-relation 394225. Up to 27296 conditions per place. [2023-09-01 03:00:03,974 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 671 selfloop transitions, 383 changer transitions 1/1100 dead transitions. [2023-09-01 03:00:03,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 1100 transitions, 26835 flow [2023-09-01 03:00:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 03:00:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 03:00:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-09-01 03:00:03,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681647940074906 [2023-09-01 03:00:03,976 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-09-01 03:00:03,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-09-01 03:00:03,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 03:00:03,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-09-01 03:00:03,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 03:00:03,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 03:00:03,978 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 03:00:03,978 INFO L175 Difference]: Start difference. First operand has 189 places, 818 transitions, 19411 flow. Second operand 8 states and 1000 transitions. [2023-09-01 03:00:03,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 1100 transitions, 26835 flow [2023-09-01 03:00:10,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 1100 transitions, 25833 flow, removed 60 selfloop flow, removed 9 redundant places. [2023-09-01 03:00:10,680 INFO L231 Difference]: Finished difference. Result has 183 places, 835 transitions, 19802 flow [2023-09-01 03:00:10,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=18607, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=365, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=19802, PETRI_PLACES=183, PETRI_TRANSITIONS=835} [2023-09-01 03:00:10,680 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 128 predicate places. [2023-09-01 03:00:10,680 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 835 transitions, 19802 flow [2023-09-01 03:00:10,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 117.1) internal successors, (1171), 10 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 03:00:10,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 03:00:10,681 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] [2023-09-01 03:00:10,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-09-01 03:00:10,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 03:00:10,882 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 03:00:10,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 03:00:10,882 INFO L85 PathProgramCache]: Analyzing trace with hash -733342054, now seen corresponding path program 1 times [2023-09-01 03:00:10,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 03:00:10,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188026006] [2023-09-01 03:00:10,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 03:00:10,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 03:00:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 03:00:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 03:00:11,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 03:00:11,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188026006] [2023-09-01 03:00:11,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188026006] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 03:00:11,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47825303] [2023-09-01 03:00:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 03:00:11,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 03:00:11,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 03:00:11,015 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 03:00:11,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-09-01 03:00:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 03:00:11,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 17 conjunts are in the unsatisfiable core [2023-09-01 03:00:11,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 03:00:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 03:00:11,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 03:00:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 03:00:11,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47825303] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 03:00:11,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 03:00:11,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2023-09-01 03:00:11,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863477153] [2023-09-01 03:00:11,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 03:00:11,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 03:00:11,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 03:00:11,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 03:00:11,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-09-01 03:00:11,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 267 [2023-09-01 03:00:11,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 835 transitions, 19802 flow. Second operand has 9 states, 9 states have (on average 125.66666666666667) internal successors, (1131), 9 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 03:00:11,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 03:00:11,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 267 [2023-09-01 03:00:11,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 03:00:25,511 INFO L130 PetriNetUnfolder]: 59469/78160 cut-off events. [2023-09-01 03:00:25,511 INFO L131 PetriNetUnfolder]: For 1850806/1868398 co-relation queries the response was YES. [2023-09-01 03:00:26,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636722 conditions, 78160 events. 59469/78160 cut-off events. For 1850806/1868398 co-relation queries the response was YES. Maximal size of possible extension queue 3391. Compared 460392 event pairs, 5236 based on Foata normal form. 9342/85172 useless extension candidates. Maximal degree in co-relation 636648. Up to 46252 conditions per place. [2023-09-01 03:00:27,070 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 548 selfloop transitions, 662 changer transitions 5/1281 dead transitions. [2023-09-01 03:00:27,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1281 transitions, 30807 flow [2023-09-01 03:00:27,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 03:00:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 03:00:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1246 transitions. [2023-09-01 03:00:27,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-09-01 03:00:27,072 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1246 transitions. [2023-09-01 03:00:27,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1246 transitions. [2023-09-01 03:00:27,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 03:00:27,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1246 transitions. [2023-09-01 03:00:27,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 138.44444444444446) internal successors, (1246), 9 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 03:00:27,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 03:00:27,075 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 03:00:27,075 INFO L175 Difference]: Start difference. First operand has 183 places, 835 transitions, 19802 flow. Second operand 9 states and 1246 transitions. [2023-09-01 03:00:27,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 1281 transitions, 30807 flow [2023-09-01 03:00:42,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1281 transitions, 29157 flow, removed 117 selfloop flow, removed 12 redundant places. [2023-09-01 03:00:42,598 INFO L231 Difference]: Finished difference. Result has 182 places, 1171 transitions, 29350 flow [2023-09-01 03:00:42,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=12560, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=29350, PETRI_PLACES=182, PETRI_TRANSITIONS=1171} [2023-09-01 03:00:42,598 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 127 predicate places. [2023-09-01 03:00:42,599 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 1171 transitions, 29350 flow [2023-09-01 03:00:42,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 125.66666666666667) internal successors, (1131), 9 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 03:00:42,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 03:00:42,599 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 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-09-01 03:00:42,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-09-01 03:00:42,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 03:00:42,804 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 03:00:42,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 03:00:42,805 INFO L85 PathProgramCache]: Analyzing trace with hash -672429962, now seen corresponding path program 2 times [2023-09-01 03:00:42,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 03:00:42,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856669798] [2023-09-01 03:00:42,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 03:00:42,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 03:00:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 03:00:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 03:00:42,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 03:00:42,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856669798] [2023-09-01 03:00:42,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856669798] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 03:00:42,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533195294] [2023-09-01 03:00:42,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 03:00:42,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 03:00:42,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 03:00:42,883 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 03:00:42,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-09-01 03:00:43,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 03:00:43,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 03:00:43,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-01 03:00:43,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 03:00:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 03:00:43,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 03:00:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 03:00:43,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533195294] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 03:00:43,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 03:00:43,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-09-01 03:00:43,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800986248] [2023-09-01 03:00:43,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 03:00:43,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 03:00:43,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 03:00:43,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 03:00:43,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-09-01 03:00:43,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-09-01 03:00:43,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 1171 transitions, 29350 flow. Second operand has 12 states, 12 states have (on average 115.91666666666667) internal successors, (1391), 12 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 03:00:43,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 03:00:43,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-09-01 03:00:43,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand