./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 AFTER --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 AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 00:00:48,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 00:00:48,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 00:00:48,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 00:00:48,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 00:00:48,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 00:00:48,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 00:00:48,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 00:00:48,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 00:00:48,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 00:00:48,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 00:00:48,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 00:00:48,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 00:00:48,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 00:00:48,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 00:00:48,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 00:00:48,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 00:00:48,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 00:00:48,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 00:00:48,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 00:00:48,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 00:00:48,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 00:00:48,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 00:00:48,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 00:00:48,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 00:00:48,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 00:00:48,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 00:00:48,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 00:00:48,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 00:00:48,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 00:00:48,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 00:00:48,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 00:00:48,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 00:00:48,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 00:00:48,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 00:00:48,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 00:00:48,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 00:00:48,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 00:00:48,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 00:00:48,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 00:00:48,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 00:00:48,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 00:00:48,518 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 00:00:48,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 00:00:48,520 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 00:00:48,520 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 00:00:48,521 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 00:00:48,521 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 00:00:48,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 00:00:48,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 00:00:48,522 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 00:00:48,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 00:00:48,523 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 00:00:48,523 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 00:00:48,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 00:00:48,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 00:00:48,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 00:00:48,524 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 00:00:48,524 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 00:00:48,525 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 00:00:48,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 00:00:48,525 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 00:00:48,525 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 00:00:48,525 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 00:00:48,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 00:00:48,526 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 00:00:48,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 00:00:48,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 00:00:48,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 00:00:48,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 00:00:48,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 00:00:48,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 00:00:48,527 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 00:00:48,527 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 00:00:48,528 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 00:00:48,528 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 00:00:48,528 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 -> AFTER [2023-08-30 00:00:48,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 00:00:48,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 00:00:48,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 00:00:48,880 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 00:00:48,880 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 00:00:48,882 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-08-30 00:00:50,043 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 00:00:50,226 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 00:00:50,227 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-08-30 00:00:50,233 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6feaf088a/e51ac396dd6e4dd3b0191abe7f85c322/FLAGbec8e98d6 [2023-08-30 00:00:50,253 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6feaf088a/e51ac396dd6e4dd3b0191abe7f85c322 [2023-08-30 00:00:50,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 00:00:50,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 00:00:50,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 00:00:50,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 00:00:50,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 00:00:50,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c9c4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50, skipping insertion in model container [2023-08-30 00:00:50,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 00:00:50,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 00:00:50,488 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-08-30 00:00:50,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 00:00:50,506 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 00:00:50,545 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-08-30 00:00:50,548 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 00:00:50,556 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 00:00:50,557 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 00:00:50,563 INFO L208 MainTranslator]: Completed translation [2023-08-30 00:00:50,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50 WrapperNode [2023-08-30 00:00:50,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 00:00:50,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 00:00:50,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 00:00:50,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 00:00:50,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,622 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2023-08-30 00:00:50,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 00:00:50,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 00:00:50,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 00:00:50,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 00:00:50,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,669 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 00:00:50,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 00:00:50,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 00:00:50,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 00:00:50,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50" (1/1) ... [2023-08-30 00:00:50,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 00:00:50,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:00:50,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 00:00:50,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 00:00:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 00:00:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 00:00:50,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 00:00:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 00:00:50,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 00:00:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 00:00:50,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 00:00:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-30 00:00:50,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-30 00:00:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 00:00:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 00:00:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 00:00:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 00:00:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 00:00:50,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 00:00:50,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 00:00:50,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 00:00:50,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 00:00:50,772 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 00:00:50,932 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 00:00:50,937 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 00:00:51,273 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 00:00:51,341 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 00:00:51,342 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-30 00:00:51,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 12:00:51 BoogieIcfgContainer [2023-08-30 00:00:51,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 00:00:51,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 00:00:51,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 00:00:51,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 00:00:51,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 12:00:50" (1/3) ... [2023-08-30 00:00:51,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d86d07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 12:00:51, skipping insertion in model container [2023-08-30 00:00:51,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:00:50" (2/3) ... [2023-08-30 00:00:51,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d86d07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 12:00:51, skipping insertion in model container [2023-08-30 00:00:51,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 12:00:51" (3/3) ... [2023-08-30 00:00:51,354 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-08-30 00:00:51,370 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 00:00:51,371 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-30 00:00:51,371 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 00:00:51,464 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-30 00:00:51,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 140 transitions, 312 flow [2023-08-30 00:00:51,594 INFO L130 PetriNetUnfolder]: 9/136 cut-off events. [2023-08-30 00:00:51,595 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 00:00:51,601 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-08-30 00:00:51,602 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 140 transitions, 312 flow [2023-08-30 00:00:51,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 132 transitions, 288 flow [2023-08-30 00:00:51,615 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 00:00:51,627 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 132 transitions, 288 flow [2023-08-30 00:00:51,631 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 132 transitions, 288 flow [2023-08-30 00:00:51,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 132 transitions, 288 flow [2023-08-30 00:00:51,679 INFO L130 PetriNetUnfolder]: 9/132 cut-off events. [2023-08-30 00:00:51,679 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 00:00:51,683 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-08-30 00:00:51,686 INFO L119 LiptonReduction]: Number of co-enabled transitions 3160 [2023-08-30 00:00:55,615 INFO L134 LiptonReduction]: Checked pairs total: 3353 [2023-08-30 00:00:55,615 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-08-30 00:00:55,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 00:00:55,636 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;@6aceadc4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 00:00:55,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-30 00:00:55,639 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 00:00:55,639 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 00:00:55,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:00:55,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 00:00:55,641 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-08-30 00:00:55,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:00:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash 570, now seen corresponding path program 1 times [2023-08-30 00:00:55,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:00:55,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039748453] [2023-08-30 00:00:55,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:00:55,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:00:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:00:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:00:55,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:00:55,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039748453] [2023-08-30 00:00:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039748453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:00:55,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:00:55,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 00:00:55,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321790746] [2023-08-30 00:00:55,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:00:55,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 00:00:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:00:55,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 00:00:55,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 00:00:55,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 267 [2023-08-30 00:00:55,863 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-08-30 00:00:55,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:00:55,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 267 [2023-08-30 00:00:55,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:00:56,304 INFO L130 PetriNetUnfolder]: 2546/3185 cut-off events. [2023-08-30 00:00:56,304 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-08-30 00:00:56,312 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-08-30 00:00:56,338 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 39 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2023-08-30 00:00:56,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 188 flow [2023-08-30 00:00:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 00:00:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 00:00:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 286 transitions. [2023-08-30 00:00:56,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5355805243445693 [2023-08-30 00:00:56,362 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 286 transitions. [2023-08-30 00:00:56,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 286 transitions. [2023-08-30 00:00:56,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:00:56,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 286 transitions. [2023-08-30 00:00:56,373 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-08-30 00:00:56,377 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-08-30 00:00:56,378 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-08-30 00:00:56,380 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 116 flow. Second operand 2 states and 286 transitions. [2023-08-30 00:00:56,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 188 flow [2023-08-30 00:00:56,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-30 00:00:56,389 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 94 flow [2023-08-30 00:00:56,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-08-30 00:00:56,395 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-08-30 00:00:56,396 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 94 flow [2023-08-30 00:00:56,397 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-08-30 00:00:56,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:00:56,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 00:00:56,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 00:00:56,401 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-08-30 00:00:56,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:00:56,409 INFO L85 PathProgramCache]: Analyzing trace with hash 561747, now seen corresponding path program 1 times [2023-08-30 00:00:56,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:00:56,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894644183] [2023-08-30 00:00:56,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:00:56,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:00:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:00:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:00:56,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:00:56,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894644183] [2023-08-30 00:00:56,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894644183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:00:56,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:00:56,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:00:56,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119361310] [2023-08-30 00:00:56,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:00:56,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:00:56,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:00:56,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:00:56,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:00:56,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:00:56,871 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-08-30 00:00:56,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:00:56,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:00:56,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:00:57,130 INFO L130 PetriNetUnfolder]: 2435/3044 cut-off events. [2023-08-30 00:00:57,130 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 00:00:57,133 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-08-30 00:00:57,153 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 36 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-30 00:00:57,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 164 flow [2023-08-30 00:00:57,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:00:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:00:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-30 00:00:57,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681647940074906 [2023-08-30 00:00:57,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-30 00:00:57,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-30 00:00:57,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:00:57,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-30 00:00:57,158 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-08-30 00:00:57,162 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-08-30 00:00:57,163 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-08-30 00:00:57,163 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 94 flow. Second operand 3 states and 375 transitions. [2023-08-30 00:00:57,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 164 flow [2023-08-30 00:00:57,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 00:00:57,165 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 92 flow [2023-08-30 00:00:57,165 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-08-30 00:00:57,166 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-08-30 00:00:57,166 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 92 flow [2023-08-30 00:00:57,166 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-08-30 00:00:57,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:00:57,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 00:00:57,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 00:00:57,167 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-08-30 00:00:57,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:00:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash 561748, now seen corresponding path program 1 times [2023-08-30 00:00:57,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:00:57,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158792707] [2023-08-30 00:00:57,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:00:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:00:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:00:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:00:57,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:00:57,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158792707] [2023-08-30 00:00:57,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158792707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:00:57,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:00:57,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:00:57,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008930605] [2023-08-30 00:00:57,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:00:57,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:00:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:00:57,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:00:57,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:00:57,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 267 [2023-08-30 00:00:57,433 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-08-30 00:00:57,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:00:57,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 267 [2023-08-30 00:00:57,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:00:57,649 INFO L130 PetriNetUnfolder]: 2324/2903 cut-off events. [2023-08-30 00:00:57,649 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 00:00:57,653 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-08-30 00:00:57,670 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 34 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-30 00:00:57,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 158 flow [2023-08-30 00:00:57,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:00:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:00:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-30 00:00:57,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46192259675405745 [2023-08-30 00:00:57,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-30 00:00:57,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-30 00:00:57,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:00:57,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-30 00:00:57,676 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-08-30 00:00:57,678 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-08-30 00:00:57,679 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-08-30 00:00:57,679 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 92 flow. Second operand 3 states and 370 transitions. [2023-08-30 00:00:57,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 158 flow [2023-08-30 00:00:57,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:00:57,681 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 89 flow [2023-08-30 00:00:57,681 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-08-30 00:00:57,682 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2023-08-30 00:00:57,682 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 89 flow [2023-08-30 00:00:57,682 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-08-30 00:00:57,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:00:57,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 00:00:57,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 00:00:57,683 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-08-30 00:00:57,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:00:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash 539853918, now seen corresponding path program 1 times [2023-08-30 00:00:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:00:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161063284] [2023-08-30 00:00:57,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:00:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:00:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:00:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:00:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:00:57,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161063284] [2023-08-30 00:00:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161063284] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:00:57,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:00:57,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:00:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955814642] [2023-08-30 00:00:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:00:57,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:00:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:00:57,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:00:57,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:00:57,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 267 [2023-08-30 00:00:57,788 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-08-30 00:00:57,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:00:57,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 267 [2023-08-30 00:00:57,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:00:57,989 INFO L130 PetriNetUnfolder]: 2278/2839 cut-off events. [2023-08-30 00:00:57,989 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 00:00:57,994 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-08-30 00:00:58,010 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 32 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-30 00:00:58,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 151 flow [2023-08-30 00:00:58,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:00:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:00:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-30 00:00:58,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45942571785268416 [2023-08-30 00:00:58,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-30 00:00:58,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-30 00:00:58,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:00:58,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-30 00:00:58,014 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-08-30 00:00:58,015 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-08-30 00:00:58,016 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-08-30 00:00:58,016 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 89 flow. Second operand 3 states and 368 transitions. [2023-08-30 00:00:58,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 151 flow [2023-08-30 00:00:58,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:00:58,018 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 86 flow [2023-08-30 00:00:58,018 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-08-30 00:00:58,019 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -12 predicate places. [2023-08-30 00:00:58,019 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 86 flow [2023-08-30 00:00:58,019 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-08-30 00:00:58,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:00:58,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 00:00:58,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 00:00:58,020 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-08-30 00:00:58,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:00:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash 539853917, now seen corresponding path program 1 times [2023-08-30 00:00:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:00:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684951259] [2023-08-30 00:00:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:00:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:00:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:00:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:00:58,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:00:58,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684951259] [2023-08-30 00:00:58,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684951259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:00:58,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:00:58,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:00:58,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447713941] [2023-08-30 00:00:58,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:00:58,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:00:58,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:00:58,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:00:58,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:00:58,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 267 [2023-08-30 00:00:58,163 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-08-30 00:00:58,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:00:58,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 267 [2023-08-30 00:00:58,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:00:58,366 INFO L130 PetriNetUnfolder]: 2232/2775 cut-off events. [2023-08-30 00:00:58,367 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 00:00:58,370 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-08-30 00:00:58,388 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 30 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-30 00:00:58,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 144 flow [2023-08-30 00:00:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:00:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:00:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-30 00:00:58,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794007490636704 [2023-08-30 00:00:58,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-30 00:00:58,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-30 00:00:58,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:00:58,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-30 00:00:58,392 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-08-30 00:00:58,393 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-08-30 00:00:58,394 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-08-30 00:00:58,394 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 86 flow. Second operand 3 states and 384 transitions. [2023-08-30 00:00:58,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 144 flow [2023-08-30 00:00:58,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 143 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:00:58,395 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 83 flow [2023-08-30 00:00:58,396 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-08-30 00:00:58,398 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2023-08-30 00:00:58,399 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 83 flow [2023-08-30 00:00:58,399 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-08-30 00:00:58,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:00:58,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:00:58,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 00:00:58,400 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-08-30 00:00:58,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:00:58,400 INFO L85 PathProgramCache]: Analyzing trace with hash -891413588, now seen corresponding path program 1 times [2023-08-30 00:00:58,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:00:58,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354124296] [2023-08-30 00:00:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:00:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:00:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:00:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:00:58,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:00:58,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354124296] [2023-08-30 00:00:58,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354124296] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:00:58,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:00:58,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:00:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221898194] [2023-08-30 00:00:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:00:58,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:00:58,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:00:58,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:00:58,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:00:58,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 267 [2023-08-30 00:00:58,529 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-08-30 00:00:58,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:00:58,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 267 [2023-08-30 00:00:58,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:00:58,743 INFO L130 PetriNetUnfolder]: 2126/2639 cut-off events. [2023-08-30 00:00:58,743 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 00:00:58,748 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-08-30 00:00:58,766 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 28 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-30 00:00:58,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 137 flow [2023-08-30 00:00:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:00:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:00:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-30 00:00:58,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4769038701622971 [2023-08-30 00:00:58,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-30 00:00:58,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-30 00:00:58,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:00:58,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-30 00:00:58,771 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-08-30 00:00:58,772 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-08-30 00:00:58,773 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-08-30 00:00:58,773 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 83 flow. Second operand 3 states and 382 transitions. [2023-08-30 00:00:58,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 137 flow [2023-08-30 00:00:58,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:00:58,776 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 80 flow [2023-08-30 00:00:58,776 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-08-30 00:00:58,779 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -14 predicate places. [2023-08-30 00:00:58,780 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 80 flow [2023-08-30 00:00:58,780 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-08-30 00:00:58,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:00:58,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:00:58,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 00:00:58,781 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-08-30 00:00:58,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:00:58,782 INFO L85 PathProgramCache]: Analyzing trace with hash -891413586, now seen corresponding path program 1 times [2023-08-30 00:00:58,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:00:58,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921351670] [2023-08-30 00:00:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:00:58,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:00:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:00:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:00:58,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:00:58,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921351670] [2023-08-30 00:00:58,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921351670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:00:58,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:00:58,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:00:58,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991312217] [2023-08-30 00:00:58,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:00:58,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:00:58,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:00:58,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:00:58,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:00:58,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 267 [2023-08-30 00:00:58,888 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-08-30 00:00:58,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:00:58,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 267 [2023-08-30 00:00:58,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:00:59,049 INFO L130 PetriNetUnfolder]: 2020/2503 cut-off events. [2023-08-30 00:00:59,050 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 00:00:59,054 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-08-30 00:00:59,066 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 26 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-30 00:00:59,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 130 flow [2023-08-30 00:00:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:00:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:00:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-30 00:00:59,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519350811485643 [2023-08-30 00:00:59,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-30 00:00:59,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-30 00:00:59,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:00:59,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-30 00:00:59,070 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-08-30 00:00:59,072 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-08-30 00:00:59,072 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-08-30 00:00:59,072 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 80 flow. Second operand 3 states and 362 transitions. [2023-08-30 00:00:59,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 130 flow [2023-08-30 00:00:59,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:00:59,074 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 77 flow [2023-08-30 00:00:59,074 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-08-30 00:00:59,074 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -15 predicate places. [2023-08-30 00:00:59,075 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 77 flow [2023-08-30 00:00:59,075 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-08-30 00:00:59,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:00:59,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:00:59,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 00:00:59,076 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-08-30 00:00:59,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:00:59,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1949952045, now seen corresponding path program 1 times [2023-08-30 00:00:59,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:00:59,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259457057] [2023-08-30 00:00:59,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:00:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:00:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:00:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:00:59,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:00:59,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259457057] [2023-08-30 00:00:59,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259457057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:00:59,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:00:59,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 00:00:59,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167139059] [2023-08-30 00:00:59,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:00:59,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 00:00:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:00:59,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 00:00:59,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 00:00:59,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 267 [2023-08-30 00:00:59,330 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-08-30 00:00:59,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:00:59,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 267 [2023-08-30 00:00:59,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:00:59,474 INFO L130 PetriNetUnfolder]: 1606/2008 cut-off events. [2023-08-30 00:00:59,474 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 00:00:59,476 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-08-30 00:00:59,482 INFO L137 encePairwiseOnDemand]: 265/267 looper letters, 25 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2023-08-30 00:00:59,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 127 flow [2023-08-30 00:00:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:00:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:00:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-30 00:00:59,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4044943820224719 [2023-08-30 00:00:59,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-30 00:00:59,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-30 00:00:59,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:00:59,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-30 00:00:59,486 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-08-30 00:00:59,487 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-08-30 00:00:59,487 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-08-30 00:00:59,487 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 77 flow. Second operand 3 states and 324 transitions. [2023-08-30 00:00:59,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 127 flow [2023-08-30 00:00:59,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:00:59,489 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow [2023-08-30 00:00:59,489 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-08-30 00:00:59,491 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -15 predicate places. [2023-08-30 00:00:59,491 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow [2023-08-30 00:00:59,492 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-08-30 00:00:59,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:00:59,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:00:59,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 00:00:59,492 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-08-30 00:00:59,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:00:59,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1949952046, now seen corresponding path program 1 times [2023-08-30 00:00:59,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:00:59,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238275365] [2023-08-30 00:00:59,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:00:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:00:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:00:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:00:59,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:00:59,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238275365] [2023-08-30 00:00:59,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238275365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:00:59,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:00:59,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:00:59,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238823247] [2023-08-30 00:00:59,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:00:59,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:00:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:00:59,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:00:59,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:00:59,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:00:59,569 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-08-30 00:00:59,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:00:59,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:00:59,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:00:59,681 INFO L130 PetriNetUnfolder]: 1192/1513 cut-off events. [2023-08-30 00:00:59,681 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 00:00:59,684 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-08-30 00:00:59,689 INFO L137 encePairwiseOnDemand]: 265/267 looper letters, 24 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-30 00:00:59,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 124 flow [2023-08-30 00:00:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:00:59,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:00:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-30 00:00:59,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519350811485643 [2023-08-30 00:00:59,691 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-30 00:00:59,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-30 00:00:59,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:00:59,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-30 00:00:59,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-08-30 00:00:59,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-08-30 00:00:59,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-08-30 00:00:59,694 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 3 states and 362 transitions. [2023-08-30 00:00:59,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 124 flow [2023-08-30 00:00:59,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 123 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:00:59,697 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 75 flow [2023-08-30 00:00:59,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-08-30 00:00:59,698 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -15 predicate places. [2023-08-30 00:00:59,698 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 75 flow [2023-08-30 00:00:59,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-08-30 00:00:59,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:00:59,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-08-30 00:00:59,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 00:00:59,699 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-08-30 00:00:59,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:00:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1815424840, now seen corresponding path program 1 times [2023-08-30 00:00:59,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:00:59,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481218812] [2023-08-30 00:00:59,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:00:59,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:00:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:00:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:00:59,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:00:59,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481218812] [2023-08-30 00:00:59,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481218812] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:00:59,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:00:59,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:00:59,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518120423] [2023-08-30 00:00:59,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:00:59,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:00:59,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:00:59,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:00:59,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:00:59,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 267 [2023-08-30 00:00:59,866 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-08-30 00:00:59,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:00:59,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 267 [2023-08-30 00:00:59,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:00,014 INFO L130 PetriNetUnfolder]: 1537/1954 cut-off events. [2023-08-30 00:01:00,015 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-08-30 00:01:00,018 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-08-30 00:01:00,024 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-08-30 00:01:00,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 220 flow [2023-08-30 00:01:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:01:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:01:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-30 00:01:00,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093632958801498 [2023-08-30 00:01:00,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-30 00:01:00,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-30 00:01:00,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:00,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-30 00:01:00,027 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-08-30 00:01:00,029 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-08-30 00:01:00,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-08-30 00:01:00,029 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 75 flow. Second operand 3 states and 408 transitions. [2023-08-30 00:01:00,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 220 flow [2023-08-30 00:01:00,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:01:00,031 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 107 flow [2023-08-30 00:01:00,032 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-08-30 00:01:00,033 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2023-08-30 00:01:00,033 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 107 flow [2023-08-30 00:01:00,033 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-08-30 00:01:00,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:00,033 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-08-30 00:01:00,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 00:01:00,033 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-08-30 00:01:00,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:00,034 INFO L85 PathProgramCache]: Analyzing trace with hash 207547760, now seen corresponding path program 1 times [2023-08-30 00:01:00,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:00,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363069321] [2023-08-30 00:01:00,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:00,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:00,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363069321] [2023-08-30 00:01:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363069321] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:01:00,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:01:00,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:01:00,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870253762] [2023-08-30 00:01:00,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:01:00,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:01:00,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:00,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:01:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:01:00,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 00:01:00,194 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-08-30 00:01:00,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:00,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 00:01:00,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:00,547 INFO L130 PetriNetUnfolder]: 2510/3336 cut-off events. [2023-08-30 00:01:00,547 INFO L131 PetriNetUnfolder]: For 897/897 co-relation queries the response was YES. [2023-08-30 00:01:00,552 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-08-30 00:01:00,563 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 88 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-08-30 00:01:00,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 95 transitions, 478 flow [2023-08-30 00:01:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-30 00:01:00,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883895131086142 [2023-08-30 00:01:00,566 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-30 00:01:00,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-30 00:01:00,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:00,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-30 00:01:00,569 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-08-30 00:01:00,571 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-08-30 00:01:00,572 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-08-30 00:01:00,572 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 107 flow. Second operand 5 states and 652 transitions. [2023-08-30 00:01:00,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 95 transitions, 478 flow [2023-08-30 00:01:00,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 95 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:01:00,576 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 137 flow [2023-08-30 00:01:00,576 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-08-30 00:01:00,577 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2023-08-30 00:01:00,577 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 137 flow [2023-08-30 00:01:00,577 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-08-30 00:01:00,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:00,577 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-08-30 00:01:00,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 00:01:00,578 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-08-30 00:01:00,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:00,578 INFO L85 PathProgramCache]: Analyzing trace with hash 767799170, now seen corresponding path program 2 times [2023-08-30 00:01:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:00,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452998177] [2023-08-30 00:01:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:00,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:00,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:00,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452998177] [2023-08-30 00:01:00,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452998177] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:01:00,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453312222] [2023-08-30 00:01:00,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 00:01:00,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:01:00,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:01:00,695 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-08-30 00:01:00,703 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-08-30 00:01:00,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 00:01:00,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:01:00,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:01:00,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:01:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:00,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:01:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453312222] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:01:00,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:01:00,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 00:01:00,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377856701] [2023-08-30 00:01:00,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:01:00,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 00:01:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:00,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 00:01:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 00:01:01,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:01:01,047 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-08-30 00:01:01,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:01,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:01:01,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:01,562 INFO L130 PetriNetUnfolder]: 3461/4613 cut-off events. [2023-08-30 00:01:01,563 INFO L131 PetriNetUnfolder]: For 3342/3760 co-relation queries the response was YES. [2023-08-30 00:01:01,573 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-08-30 00:01:01,593 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 89 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2023-08-30 00:01:01,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 97 transitions, 538 flow [2023-08-30 00:01:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-08-30 00:01:01,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794007490636704 [2023-08-30 00:01:01,596 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-08-30 00:01:01,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-08-30 00:01:01,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:01,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-08-30 00:01:01,598 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-08-30 00:01:01,600 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-08-30 00:01:01,601 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-08-30 00:01:01,601 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 137 flow. Second operand 5 states and 640 transitions. [2023-08-30 00:01:01,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 97 transitions, 538 flow [2023-08-30 00:01:01,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 97 transitions, 519 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 00:01:01,605 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 172 flow [2023-08-30 00:01:01,605 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-08-30 00:01:01,606 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2023-08-30 00:01:01,606 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 172 flow [2023-08-30 00:01:01,607 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-08-30 00:01:01,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:01,607 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-08-30 00:01:01,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 00:01:01,813 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-08-30 00:01:01,814 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-08-30 00:01:01,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1486827478, now seen corresponding path program 3 times [2023-08-30 00:01:01,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:01,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296301300] [2023-08-30 00:01:01,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:01,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:01,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:01,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296301300] [2023-08-30 00:01:01,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296301300] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:01:01,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:01:01,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:01:01,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971985444] [2023-08-30 00:01:01,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:01:01,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:01:01,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:01,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:01:01,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:01:01,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 00:01:01,916 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-08-30 00:01:01,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:01,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 00:01:01,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:02,486 INFO L130 PetriNetUnfolder]: 5074/6883 cut-off events. [2023-08-30 00:01:02,487 INFO L131 PetriNetUnfolder]: For 9066/9653 co-relation queries the response was YES. [2023-08-30 00:01:02,512 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-08-30 00:01:02,544 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 97 selfloop transitions, 8 changer transitions 0/107 dead transitions. [2023-08-30 00:01:02,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 107 transitions, 663 flow [2023-08-30 00:01:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-30 00:01:02,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853932584269663 [2023-08-30 00:01:02,548 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-30 00:01:02,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-30 00:01:02,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:02,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-30 00:01:02,550 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-08-30 00:01:02,552 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-08-30 00:01:02,553 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-08-30 00:01:02,553 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 172 flow. Second operand 5 states and 648 transitions. [2023-08-30 00:01:02,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 107 transitions, 663 flow [2023-08-30 00:01:02,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 107 transitions, 649 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 00:01:02,564 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 229 flow [2023-08-30 00:01:02,565 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-08-30 00:01:02,566 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2023-08-30 00:01:02,566 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 229 flow [2023-08-30 00:01:02,567 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-08-30 00:01:02,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:02,567 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-08-30 00:01:02,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 00:01:02,567 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-08-30 00:01:02,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1385284445, now seen corresponding path program 1 times [2023-08-30 00:01:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591596409] [2023-08-30 00:01:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:02,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:02,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591596409] [2023-08-30 00:01:02,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591596409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:01:02,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:01:02,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:01:02,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589203562] [2023-08-30 00:01:02,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:01:02,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:01:02,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:02,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:01:02,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:01:02,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:01:02,694 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-08-30 00:01:02,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:02,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:01:02,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:03,503 INFO L130 PetriNetUnfolder]: 6819/9240 cut-off events. [2023-08-30 00:01:03,504 INFO L131 PetriNetUnfolder]: For 19138/20147 co-relation queries the response was YES. [2023-08-30 00:01:03,553 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-08-30 00:01:03,601 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 107 selfloop transitions, 12 changer transitions 0/122 dead transitions. [2023-08-30 00:01:03,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 122 transitions, 799 flow [2023-08-30 00:01:03,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2023-08-30 00:01:03,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49288389513108616 [2023-08-30 00:01:03,604 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions. [2023-08-30 00:01:03,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions. [2023-08-30 00:01:03,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:03,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions. [2023-08-30 00:01:03,606 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-08-30 00:01:03,608 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-08-30 00:01:03,608 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-08-30 00:01:03,608 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 229 flow. Second operand 5 states and 658 transitions. [2023-08-30 00:01:03,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 122 transitions, 799 flow [2023-08-30 00:01:03,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 759 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-30 00:01:03,634 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 311 flow [2023-08-30 00:01:03,634 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-08-30 00:01:03,635 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places. [2023-08-30 00:01:03,635 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 311 flow [2023-08-30 00:01:03,635 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-08-30 00:01:03,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:03,636 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-08-30 00:01:03,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 00:01:03,636 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-08-30 00:01:03,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1717524940, now seen corresponding path program 4 times [2023-08-30 00:01:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:03,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569363052] [2023-08-30 00:01:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:03,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:03,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:03,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569363052] [2023-08-30 00:01:03,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569363052] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:01:03,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817682587] [2023-08-30 00:01:03,731 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 00:01:03,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:01:03,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:01:03,732 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-08-30 00:01:03,761 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-08-30 00:01:03,884 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 00:01:03,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:01:03,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:01:03,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:01:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:03,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:01:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:03,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817682587] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:01:03,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:01:03,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 00:01:03,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996196713] [2023-08-30 00:01:03,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:01:03,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:01:03,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:03,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:01:03,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:01:04,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:01:04,060 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-08-30 00:01:04,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:04,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:01:04,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:05,254 INFO L130 PetriNetUnfolder]: 7477/10190 cut-off events. [2023-08-30 00:01:05,254 INFO L131 PetriNetUnfolder]: For 23311/24335 co-relation queries the response was YES. [2023-08-30 00:01:05,290 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-08-30 00:01:05,336 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 107 selfloop transitions, 15 changer transitions 0/125 dead transitions. [2023-08-30 00:01:05,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 125 transitions, 881 flow [2023-08-30 00:01:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:05,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-30 00:01:05,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48764044943820223 [2023-08-30 00:01:05,339 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-30 00:01:05,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-30 00:01:05,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:05,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-30 00:01:05,341 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-08-30 00:01:05,343 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-08-30 00:01:05,344 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-08-30 00:01:05,344 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 311 flow. Second operand 5 states and 651 transitions. [2023-08-30 00:01:05,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 125 transitions, 881 flow [2023-08-30 00:01:05,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 125 transitions, 849 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 00:01:05,408 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 412 flow [2023-08-30 00:01:05,408 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-08-30 00:01:05,409 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2023-08-30 00:01:05,409 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 412 flow [2023-08-30 00:01:05,410 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-08-30 00:01:05,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:05,410 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-08-30 00:01:05,418 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-08-30 00:01:05,615 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-08-30 00:01:05,615 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-08-30 00:01:05,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash 121399556, now seen corresponding path program 5 times [2023-08-30 00:01:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:05,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854989935] [2023-08-30 00:01:05,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:05,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:05,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854989935] [2023-08-30 00:01:05,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854989935] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:01:05,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747782803] [2023-08-30 00:01:05,696 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 00:01:05,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:01:05,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:01:05,698 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-08-30 00:01:05,726 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-08-30 00:01:05,800 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 00:01:05,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:01:05,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:01:05,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:01:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:05,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:01:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747782803] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:01:05,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:01:05,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 00:01:05,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892336804] [2023-08-30 00:01:05,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:01:05,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 00:01:05,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:05,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 00:01:05,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 00:01:05,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:01:05,921 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-08-30 00:01:05,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:05,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:01:05,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:07,035 INFO L130 PetriNetUnfolder]: 8095/10930 cut-off events. [2023-08-30 00:01:07,036 INFO L131 PetriNetUnfolder]: For 26014/27098 co-relation queries the response was YES. [2023-08-30 00:01:07,081 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-08-30 00:01:07,126 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 100 selfloop transitions, 15 changer transitions 0/118 dead transitions. [2023-08-30 00:01:07,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 118 transitions, 898 flow [2023-08-30 00:01:07,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-08-30 00:01:07,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794007490636704 [2023-08-30 00:01:07,129 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-08-30 00:01:07,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-08-30 00:01:07,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:07,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-08-30 00:01:07,131 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-08-30 00:01:07,133 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-08-30 00:01:07,134 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-08-30 00:01:07,134 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 412 flow. Second operand 5 states and 640 transitions. [2023-08-30 00:01:07,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 118 transitions, 898 flow [2023-08-30 00:01:07,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 118 transitions, 876 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-30 00:01:07,185 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 456 flow [2023-08-30 00:01:07,185 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-08-30 00:01:07,186 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 21 predicate places. [2023-08-30 00:01:07,186 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 456 flow [2023-08-30 00:01:07,187 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-08-30 00:01:07,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:07,187 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-08-30 00:01:07,193 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-08-30 00:01:07,393 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-08-30 00:01:07,393 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-08-30 00:01:07,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:07,394 INFO L85 PathProgramCache]: Analyzing trace with hash 389338049, now seen corresponding path program 2 times [2023-08-30 00:01:07,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:07,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324292472] [2023-08-30 00:01:07,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:07,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:07,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324292472] [2023-08-30 00:01:07,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324292472] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:01:07,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401033567] [2023-08-30 00:01:07,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 00:01:07,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:01:07,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:01:07,474 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-08-30 00:01:07,501 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-08-30 00:01:07,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 00:01:07,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:01:07,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:01:07,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:01:07,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-08-30 00:01:07,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:01:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:07,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401033567] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:01:07,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:01:07,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 00:01:07,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226324297] [2023-08-30 00:01:07,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:01:07,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 00:01:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:07,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 00:01:07,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 00:01:07,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:01:07,687 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-08-30 00:01:07,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:07,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:01:07,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:08,611 INFO L130 PetriNetUnfolder]: 8305/11430 cut-off events. [2023-08-30 00:01:08,612 INFO L131 PetriNetUnfolder]: For 35137/36517 co-relation queries the response was YES. [2023-08-30 00:01:08,664 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-08-30 00:01:08,710 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 99 selfloop transitions, 13 changer transitions 0/120 dead transitions. [2023-08-30 00:01:08,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 120 transitions, 958 flow [2023-08-30 00:01:08,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-08-30 00:01:08,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779026217228464 [2023-08-30 00:01:08,713 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-08-30 00:01:08,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-08-30 00:01:08,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:08,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-08-30 00:01:08,714 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-08-30 00:01:08,716 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-08-30 00:01:08,717 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-08-30 00:01:08,717 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 456 flow. Second operand 5 states and 638 transitions. [2023-08-30 00:01:08,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 120 transitions, 958 flow [2023-08-30 00:01:08,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 120 transitions, 932 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 00:01:08,778 INFO L231 Difference]: Finished difference. Result has 80 places, 60 transitions, 483 flow [2023-08-30 00:01:08,778 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-08-30 00:01:08,778 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 25 predicate places. [2023-08-30 00:01:08,778 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 60 transitions, 483 flow [2023-08-30 00:01:08,779 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-08-30 00:01:08,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:08,779 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-08-30 00:01:08,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-30 00:01:08,985 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-08-30 00:01:08,985 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-08-30 00:01:08,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1551309662, now seen corresponding path program 1 times [2023-08-30 00:01:08,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:08,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772962985] [2023-08-30 00:01:08,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:08,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:09,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:09,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772962985] [2023-08-30 00:01:09,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772962985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:01:09,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:01:09,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:01:09,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285682552] [2023-08-30 00:01:09,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:01:09,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:01:09,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:09,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:01:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:01:09,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 00:01:09,085 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-08-30 00:01:09,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:09,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 00:01:09,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:10,239 INFO L130 PetriNetUnfolder]: 9253/12713 cut-off events. [2023-08-30 00:01:10,239 INFO L131 PetriNetUnfolder]: For 53007/54739 co-relation queries the response was YES. [2023-08-30 00:01:10,297 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-08-30 00:01:10,341 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 116 selfloop transitions, 15 changer transitions 0/136 dead transitions. [2023-08-30 00:01:10,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 136 transitions, 1124 flow [2023-08-30 00:01:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-30 00:01:10,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883895131086142 [2023-08-30 00:01:10,343 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-30 00:01:10,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-30 00:01:10,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:10,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-30 00:01:10,345 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-08-30 00:01:10,347 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-08-30 00:01:10,347 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-08-30 00:01:10,348 INFO L175 Difference]: Start difference. First operand has 80 places, 60 transitions, 483 flow. Second operand 5 states and 652 transitions. [2023-08-30 00:01:10,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 136 transitions, 1124 flow [2023-08-30 00:01:10,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 136 transitions, 1094 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 00:01:10,437 INFO L231 Difference]: Finished difference. Result has 85 places, 62 transitions, 532 flow [2023-08-30 00:01:10,437 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-08-30 00:01:10,437 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2023-08-30 00:01:10,437 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 62 transitions, 532 flow [2023-08-30 00:01:10,438 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-08-30 00:01:10,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:10,438 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-08-30 00:01:10,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 00:01:10,438 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-08-30 00:01:10,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:10,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1124083191, now seen corresponding path program 3 times [2023-08-30 00:01:10,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:10,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720066415] [2023-08-30 00:01:10,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:10,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:10,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:10,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720066415] [2023-08-30 00:01:10,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720066415] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:01:10,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138074388] [2023-08-30 00:01:10,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 00:01:10,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:01:10,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:01:10,529 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-08-30 00:01:10,553 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-08-30 00:01:10,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 00:01:10,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:01:10,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:01:10,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:01:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:10,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:01:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:10,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138074388] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:01:10,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:01:10,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 00:01:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531014715] [2023-08-30 00:01:10,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:01:10,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:01:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:10,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:01:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:01:10,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:01:10,795 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-08-30 00:01:10,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:10,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:01:10,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:12,809 INFO L130 PetriNetUnfolder]: 15721/21933 cut-off events. [2023-08-30 00:01:12,810 INFO L131 PetriNetUnfolder]: For 81160/82718 co-relation queries the response was YES. [2023-08-30 00:01:12,955 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-08-30 00:01:13,039 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 172 selfloop transitions, 35 changer transitions 0/215 dead transitions. [2023-08-30 00:01:13,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 215 transitions, 1849 flow [2023-08-30 00:01:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 00:01:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 00:01:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1035 transitions. [2023-08-30 00:01:13,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845505617977528 [2023-08-30 00:01:13,043 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1035 transitions. [2023-08-30 00:01:13,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1035 transitions. [2023-08-30 00:01:13,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:13,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1035 transitions. [2023-08-30 00:01:13,046 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-08-30 00:01:13,049 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-08-30 00:01:13,049 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-08-30 00:01:13,049 INFO L175 Difference]: Start difference. First operand has 85 places, 62 transitions, 532 flow. Second operand 8 states and 1035 transitions. [2023-08-30 00:01:13,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 215 transitions, 1849 flow [2023-08-30 00:01:13,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 215 transitions, 1783 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-08-30 00:01:13,151 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 870 flow [2023-08-30 00:01:13,151 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-08-30 00:01:13,151 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 40 predicate places. [2023-08-30 00:01:13,152 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 870 flow [2023-08-30 00:01:13,152 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-08-30 00:01:13,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:13,153 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-08-30 00:01:13,162 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-08-30 00:01:13,362 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-08-30 00:01:13,363 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-08-30 00:01:13,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash 887138534, now seen corresponding path program 2 times [2023-08-30 00:01:13,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:13,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996072460] [2023-08-30 00:01:13,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:13,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:13,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:13,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996072460] [2023-08-30 00:01:13,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996072460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:01:13,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:01:13,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:01:13,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529168835] [2023-08-30 00:01:13,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:01:13,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:01:13,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:13,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:01:13,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:01:13,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:01:13,469 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-08-30 00:01:13,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:13,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:01:13,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:14,487 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-08-30 00:01:14,488 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 00:01:14,488 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:01:14,488 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:01:14,488 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:01:14,489 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-08-30 00:01:14,489 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 00:01:14,489 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:01:14,489 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:01:14,489 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:01:14,610 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-08-30 00:01:14,610 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 00:01:14,610 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:01:14,610 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:01:14,610 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:01:14,611 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-08-30 00:01:14,612 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 00:01:14,612 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:01:14,612 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:01:14,612 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:01:14,707 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-08-30 00:01:14,708 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 00:01:14,708 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:01:14,708 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:01:14,708 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:01:14,765 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-08-30 00:01:14,765 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 00:01:14,766 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:01:14,766 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:01:14,766 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:01:14,767 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-08-30 00:01:14,768 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 00:01:14,768 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:01:14,768 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:01:14,768 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:01:14,852 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-08-30 00:01:14,852 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 00:01:14,852 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:01:14,853 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:01:14,853 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:01:15,172 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-08-30 00:01:15,173 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 00:01:15,173 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:01:15,173 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:01:15,173 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:01:15,175 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-08-30 00:01:15,175 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 00:01:15,177 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:01:15,177 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:01:15,177 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:01:15,368 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-08-30 00:01:15,368 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 00:01:15,368 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:01:15,368 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:01:15,368 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:01:15,370 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-08-30 00:01:15,371 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 00:01:15,371 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:01:15,371 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:01:15,371 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:01:15,498 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-08-30 00:01:15,498 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 00:01:15,498 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:01:15,498 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:01:15,499 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:01:15,974 INFO L130 PetriNetUnfolder]: 17427/24411 cut-off events. [2023-08-30 00:01:15,974 INFO L131 PetriNetUnfolder]: For 128682/131017 co-relation queries the response was YES. [2023-08-30 00:01:16,172 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-08-30 00:01:16,274 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 172 selfloop transitions, 50 changer transitions 0/227 dead transitions. [2023-08-30 00:01:16,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 227 transitions, 2529 flow [2023-08-30 00:01:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 00:01:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 00:01:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2023-08-30 00:01:16,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48002496878901374 [2023-08-30 00:01:16,277 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 769 transitions. [2023-08-30 00:01:16,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions. [2023-08-30 00:01:16,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:16,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions. [2023-08-30 00:01:16,279 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-08-30 00:01:16,282 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-08-30 00:01:16,283 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-08-30 00:01:16,283 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 870 flow. Second operand 6 states and 769 transitions. [2023-08-30 00:01:16,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 227 transitions, 2529 flow [2023-08-30 00:01:16,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 227 transitions, 2529 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 00:01:16,488 INFO L231 Difference]: Finished difference. Result has 103 places, 112 transitions, 1345 flow [2023-08-30 00:01:16,488 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-08-30 00:01:16,489 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2023-08-30 00:01:16,489 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 112 transitions, 1345 flow [2023-08-30 00:01:16,490 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-08-30 00:01:16,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:16,490 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-08-30 00:01:16,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 00:01:16,491 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-08-30 00:01:16,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1966858371, now seen corresponding path program 4 times [2023-08-30 00:01:16,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:16,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178950826] [2023-08-30 00:01:16,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:16,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:16,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:16,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178950826] [2023-08-30 00:01:16,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178950826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:01:16,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:01:16,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:01:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541209047] [2023-08-30 00:01:16,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:01:16,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:01:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:16,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:01:16,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:01:16,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 00:01:16,594 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-08-30 00:01:16,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:16,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 00:01:16,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:19,020 INFO L130 PetriNetUnfolder]: 17150/24038 cut-off events. [2023-08-30 00:01:19,021 INFO L131 PetriNetUnfolder]: For 154577/156887 co-relation queries the response was YES. [2023-08-30 00:01:19,232 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-08-30 00:01:19,321 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 147 selfloop transitions, 23 changer transitions 2/183 dead transitions. [2023-08-30 00:01:19,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 183 transitions, 2236 flow [2023-08-30 00:01:19,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-30 00:01:19,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48389513108614235 [2023-08-30 00:01:19,323 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-30 00:01:19,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-30 00:01:19,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:19,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-30 00:01:19,325 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-08-30 00:01:19,327 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-08-30 00:01:19,327 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-08-30 00:01:19,327 INFO L175 Difference]: Start difference. First operand has 103 places, 112 transitions, 1345 flow. Second operand 5 states and 646 transitions. [2023-08-30 00:01:19,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 183 transitions, 2236 flow [2023-08-30 00:01:19,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 183 transitions, 2099 flow, removed 41 selfloop flow, removed 2 redundant places. [2023-08-30 00:01:19,701 INFO L231 Difference]: Finished difference. Result has 107 places, 116 transitions, 1399 flow [2023-08-30 00:01:19,701 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-08-30 00:01:19,702 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 52 predicate places. [2023-08-30 00:01:19,702 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 116 transitions, 1399 flow [2023-08-30 00:01:19,702 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-08-30 00:01:19,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:19,703 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-08-30 00:01:19,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 00:01:19,703 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-08-30 00:01:19,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:19,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1479612490, now seen corresponding path program 3 times [2023-08-30 00:01:19,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:19,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660103686] [2023-08-30 00:01:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:19,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:19,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:19,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660103686] [2023-08-30 00:01:19,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660103686] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:01:19,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:01:19,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:01:19,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408589744] [2023-08-30 00:01:19,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:01:19,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:01:19,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:19,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:01:19,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:01:19,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:01:19,790 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-08-30 00:01:19,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:19,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:01:19,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:20,681 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-08-30 00:01:20,681 INFO L383 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2023-08-30 00:01:20,681 INFO L386 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-08-30 00:01:20,681 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:01:20,681 INFO L386 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-08-30 00:01:21,086 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-08-30 00:01:21,086 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 00:01:21,086 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:01:21,087 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:01:21,087 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:01:21,088 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-08-30 00:01:21,088 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 00:01:21,088 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:01:21,088 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:01:21,088 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:01:21,320 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-08-30 00:01:21,320 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 00:01:21,321 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:01:21,321 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:01:21,321 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:01:22,555 INFO L130 PetriNetUnfolder]: 16637/23465 cut-off events. [2023-08-30 00:01:22,556 INFO L131 PetriNetUnfolder]: For 182759/185123 co-relation queries the response was YES. [2023-08-30 00:01:22,751 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-08-30 00:01:22,832 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 152 selfloop transitions, 52 changer transitions 0/209 dead transitions. [2023-08-30 00:01:22,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 209 transitions, 2583 flow [2023-08-30 00:01:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2023-08-30 00:01:22,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-08-30 00:01:22,833 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2023-08-30 00:01:22,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2023-08-30 00:01:22,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:22,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2023-08-30 00:01:22,835 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-08-30 00:01:22,836 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-08-30 00:01:22,837 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-08-30 00:01:22,837 INFO L175 Difference]: Start difference. First operand has 107 places, 116 transitions, 1399 flow. Second operand 5 states and 650 transitions. [2023-08-30 00:01:22,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 209 transitions, 2583 flow [2023-08-30 00:01:23,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 209 transitions, 2502 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-08-30 00:01:23,333 INFO L231 Difference]: Finished difference. Result has 111 places, 138 transitions, 1880 flow [2023-08-30 00:01:23,334 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-08-30 00:01:23,334 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 56 predicate places. [2023-08-30 00:01:23,334 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 138 transitions, 1880 flow [2023-08-30 00:01:23,334 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-08-30 00:01:23,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:23,335 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-08-30 00:01:23,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 00:01:23,335 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-08-30 00:01:23,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:23,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1539562932, now seen corresponding path program 4 times [2023-08-30 00:01:23,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:23,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481567921] [2023-08-30 00:01:23,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:23,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:23,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:23,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481567921] [2023-08-30 00:01:23,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481567921] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:01:23,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451023113] [2023-08-30 00:01:23,403 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 00:01:23,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:01:23,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:01:23,405 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-08-30 00:01:23,408 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-08-30 00:01:23,498 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 00:01:23,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:01:23,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:01:23,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:01:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:23,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:01:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:23,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451023113] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:01:23,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:01:23,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 00:01:23,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989180191] [2023-08-30 00:01:23,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:01:23,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 00:01:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:23,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 00:01:23,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 00:01:23,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:01:23,597 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-08-30 00:01:23,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:23,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:01:23,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:26,246 INFO L130 PetriNetUnfolder]: 17939/25152 cut-off events. [2023-08-30 00:01:26,247 INFO L131 PetriNetUnfolder]: For 197071/199029 co-relation queries the response was YES. [2023-08-30 00:01:26,447 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-08-30 00:01:26,693 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 151 selfloop transitions, 54 changer transitions 0/218 dead transitions. [2023-08-30 00:01:26,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 218 transitions, 3002 flow [2023-08-30 00:01:26,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-08-30 00:01:26,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4749063670411985 [2023-08-30 00:01:26,695 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-08-30 00:01:26,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-08-30 00:01:26,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:26,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-08-30 00:01:26,697 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-08-30 00:01:26,699 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-08-30 00:01:26,699 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-08-30 00:01:26,699 INFO L175 Difference]: Start difference. First operand has 111 places, 138 transitions, 1880 flow. Second operand 5 states and 634 transitions. [2023-08-30 00:01:26,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 218 transitions, 3002 flow [2023-08-30 00:01:27,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 218 transitions, 2904 flow, removed 28 selfloop flow, removed 1 redundant places. [2023-08-30 00:01:27,359 INFO L231 Difference]: Finished difference. Result has 116 places, 146 transitions, 2073 flow [2023-08-30 00:01:27,360 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-08-30 00:01:27,360 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 61 predicate places. [2023-08-30 00:01:27,360 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 146 transitions, 2073 flow [2023-08-30 00:01:27,361 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-08-30 00:01:27,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:27,361 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-08-30 00:01:27,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 00:01:27,567 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-08-30 00:01:27,567 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-08-30 00:01:27,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1927607435, now seen corresponding path program 1 times [2023-08-30 00:01:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:27,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628653183] [2023-08-30 00:01:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:27,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:27,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:27,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628653183] [2023-08-30 00:01:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628653183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:01:27,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:01:27,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:01:27,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338548931] [2023-08-30 00:01:27,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:01:27,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:01:27,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:01:27,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:01:27,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 00:01:27,660 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-08-30 00:01:27,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:27,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 00:01:27,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:31,078 INFO L130 PetriNetUnfolder]: 20402/29889 cut-off events. [2023-08-30 00:01:31,079 INFO L131 PetriNetUnfolder]: For 264010/270580 co-relation queries the response was YES. [2023-08-30 00:01:31,305 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-08-30 00:01:31,390 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 173 selfloop transitions, 39 changer transitions 1/231 dead transitions. [2023-08-30 00:01:31,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 231 transitions, 3138 flow [2023-08-30 00:01:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2023-08-30 00:01:31,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-08-30 00:01:31,393 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2023-08-30 00:01:31,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2023-08-30 00:01:31,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:31,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2023-08-30 00:01:31,395 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-08-30 00:01:31,397 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-08-30 00:01:31,397 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-08-30 00:01:31,397 INFO L175 Difference]: Start difference. First operand has 116 places, 146 transitions, 2073 flow. Second operand 5 states and 650 transitions. [2023-08-30 00:01:31,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 231 transitions, 3138 flow [2023-08-30 00:01:32,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 3080 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 00:01:32,134 INFO L231 Difference]: Finished difference. Result has 120 places, 147 transitions, 2112 flow [2023-08-30 00:01:32,134 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-08-30 00:01:32,136 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 65 predicate places. [2023-08-30 00:01:32,136 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 147 transitions, 2112 flow [2023-08-30 00:01:32,136 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-08-30 00:01:32,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:32,136 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-08-30 00:01:32,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 00:01:32,137 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-08-30 00:01:32,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:32,137 INFO L85 PathProgramCache]: Analyzing trace with hash 15975187, now seen corresponding path program 2 times [2023-08-30 00:01:32,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:32,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779551496] [2023-08-30 00:01:32,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:32,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:32,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:32,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779551496] [2023-08-30 00:01:32,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779551496] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:01:32,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301099140] [2023-08-30 00:01:32,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 00:01:32,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:01:32,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:01:32,210 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-08-30 00:01:32,214 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-08-30 00:01:32,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 00:01:32,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:01:32,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:01:32,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:01:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:32,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:01:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:32,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301099140] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:01:32,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:01:32,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 00:01:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417904680] [2023-08-30 00:01:32,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:01:32,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 00:01:32,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:32,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 00:01:32,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 00:01:32,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:01:32,430 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-08-30 00:01:32,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:32,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:01:32,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:37,394 INFO L130 PetriNetUnfolder]: 30135/43297 cut-off events. [2023-08-30 00:01:37,394 INFO L131 PetriNetUnfolder]: For 408004/413204 co-relation queries the response was YES. [2023-08-30 00:01:37,873 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-08-30 00:01:38,044 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 329 selfloop transitions, 43 changer transitions 6/395 dead transitions. [2023-08-30 00:01:38,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 395 transitions, 6433 flow [2023-08-30 00:01:38,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2023-08-30 00:01:38,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47340823970037454 [2023-08-30 00:01:38,046 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2023-08-30 00:01:38,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2023-08-30 00:01:38,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:38,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2023-08-30 00:01:38,048 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-08-30 00:01:38,050 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-08-30 00:01:38,050 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-08-30 00:01:38,050 INFO L175 Difference]: Start difference. First operand has 120 places, 147 transitions, 2112 flow. Second operand 5 states and 632 transitions. [2023-08-30 00:01:38,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 395 transitions, 6433 flow [2023-08-30 00:01:39,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 395 transitions, 6268 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 00:01:39,973 INFO L231 Difference]: Finished difference. Result has 125 places, 185 transitions, 2852 flow [2023-08-30 00:01:39,973 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-08-30 00:01:39,974 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 70 predicate places. [2023-08-30 00:01:39,974 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 185 transitions, 2852 flow [2023-08-30 00:01:39,975 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-08-30 00:01:39,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:39,975 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-08-30 00:01:39,981 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-08-30 00:01:40,181 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-08-30 00:01:40,181 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-08-30 00:01:40,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:40,182 INFO L85 PathProgramCache]: Analyzing trace with hash -671385108, now seen corresponding path program 5 times [2023-08-30 00:01:40,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:40,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228770988] [2023-08-30 00:01:40,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:40,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:40,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:40,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228770988] [2023-08-30 00:01:40,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228770988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:01:40,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:01:40,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:01:40,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604297414] [2023-08-30 00:01:40,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:01:40,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:01:40,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:40,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:01:40,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:01:40,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:01:40,270 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-08-30 00:01:40,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:40,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:01:40,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:44,961 INFO L130 PetriNetUnfolder]: 27421/39615 cut-off events. [2023-08-30 00:01:44,961 INFO L131 PetriNetUnfolder]: For 413299/416259 co-relation queries the response was YES. [2023-08-30 00:01:45,403 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-08-30 00:01:45,545 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 178 selfloop transitions, 108 changer transitions 2/302 dead transitions. [2023-08-30 00:01:45,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 302 transitions, 4573 flow [2023-08-30 00:01:45,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 00:01:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 00:01:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2023-08-30 00:01:45,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4812734082397004 [2023-08-30 00:01:45,547 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2023-08-30 00:01:45,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2023-08-30 00:01:45,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:45,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2023-08-30 00:01:45,549 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-08-30 00:01:45,551 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-08-30 00:01:45,551 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-08-30 00:01:45,551 INFO L175 Difference]: Start difference. First operand has 125 places, 185 transitions, 2852 flow. Second operand 6 states and 771 transitions. [2023-08-30 00:01:45,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 302 transitions, 4573 flow [2023-08-30 00:01:47,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 302 transitions, 4532 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-08-30 00:01:47,459 INFO L231 Difference]: Finished difference. Result has 133 places, 210 transitions, 3591 flow [2023-08-30 00:01:47,460 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-08-30 00:01:47,460 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 78 predicate places. [2023-08-30 00:01:47,460 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 210 transitions, 3591 flow [2023-08-30 00:01:47,461 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-08-30 00:01:47,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:47,461 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-08-30 00:01:47,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-30 00:01:47,461 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-08-30 00:01:47,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:47,461 INFO L85 PathProgramCache]: Analyzing trace with hash -496087306, now seen corresponding path program 6 times [2023-08-30 00:01:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:47,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467086580] [2023-08-30 00:01:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:47,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:47,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:47,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467086580] [2023-08-30 00:01:47,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467086580] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:01:47,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:01:47,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:01:47,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068774182] [2023-08-30 00:01:47,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:01:47,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:01:47,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:47,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:01:47,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:01:47,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 00:01:47,544 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-08-30 00:01:47,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:47,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 00:01:47,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:01:52,661 INFO L130 PetriNetUnfolder]: 28365/41426 cut-off events. [2023-08-30 00:01:52,661 INFO L131 PetriNetUnfolder]: For 511297/514382 co-relation queries the response was YES. [2023-08-30 00:01:53,159 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-08-30 00:01:53,531 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 253 selfloop transitions, 45 changer transitions 6/318 dead transitions. [2023-08-30 00:01:53,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 318 transitions, 5475 flow [2023-08-30 00:01:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:01:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:01:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2023-08-30 00:01:53,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-08-30 00:01:53,533 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2023-08-30 00:01:53,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2023-08-30 00:01:53,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:01:53,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2023-08-30 00:01:53,534 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-08-30 00:01:53,536 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-08-30 00:01:53,536 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-08-30 00:01:53,536 INFO L175 Difference]: Start difference. First operand has 133 places, 210 transitions, 3591 flow. Second operand 5 states and 650 transitions. [2023-08-30 00:01:53,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 318 transitions, 5475 flow [2023-08-30 00:01:55,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 318 transitions, 5397 flow, removed 39 selfloop flow, removed 0 redundant places. [2023-08-30 00:01:55,943 INFO L231 Difference]: Finished difference. Result has 139 places, 213 transitions, 3709 flow [2023-08-30 00:01:55,944 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-08-30 00:01:55,944 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 84 predicate places. [2023-08-30 00:01:55,944 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 213 transitions, 3709 flow [2023-08-30 00:01:55,944 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-08-30 00:01:55,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:01:55,944 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-08-30 00:01:55,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-30 00:01:55,945 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-08-30 00:01:55,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:01:55,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1842347611, now seen corresponding path program 3 times [2023-08-30 00:01:55,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:01:55,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106912582] [2023-08-30 00:01:55,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:01:55,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:01:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:01:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:01:56,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:01:56,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106912582] [2023-08-30 00:01:56,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106912582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:01:56,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:01:56,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:01:56,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95596813] [2023-08-30 00:01:56,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:01:56,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:01:56,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:01:56,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:01:56,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:01:56,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:01:56,055 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-08-30 00:01:56,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:01:56,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:01:56,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:02:02,637 INFO L130 PetriNetUnfolder]: 33411/49244 cut-off events. [2023-08-30 00:02:02,637 INFO L131 PetriNetUnfolder]: For 663876/672333 co-relation queries the response was YES. [2023-08-30 00:02:03,194 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-08-30 00:02:03,351 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 262 selfloop transitions, 65 changer transitions 14/376 dead transitions. [2023-08-30 00:02:03,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 376 transitions, 6551 flow [2023-08-30 00:02:03,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:02:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:02:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-30 00:02:03,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853932584269663 [2023-08-30 00:02:03,353 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-30 00:02:03,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-30 00:02:03,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:02:03,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-30 00:02:03,354 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-08-30 00:02:03,355 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-08-30 00:02:03,355 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-08-30 00:02:03,356 INFO L175 Difference]: Start difference. First operand has 139 places, 213 transitions, 3709 flow. Second operand 5 states and 648 transitions. [2023-08-30 00:02:03,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 376 transitions, 6551 flow [2023-08-30 00:02:05,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 376 transitions, 6413 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 00:02:05,699 INFO L231 Difference]: Finished difference. Result has 144 places, 242 transitions, 4318 flow [2023-08-30 00:02:05,699 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-08-30 00:02:05,700 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 89 predicate places. [2023-08-30 00:02:05,700 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 242 transitions, 4318 flow [2023-08-30 00:02:05,700 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-08-30 00:02:05,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:02:05,700 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-08-30 00:02:05,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-30 00:02:05,701 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-08-30 00:02:05,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:02:05,701 INFO L85 PathProgramCache]: Analyzing trace with hash 944870335, now seen corresponding path program 4 times [2023-08-30 00:02:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:02:05,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358026129] [2023-08-30 00:02:05,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:02:05,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:02:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:02:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:02:05,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:02:05,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358026129] [2023-08-30 00:02:05,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358026129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:02:05,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:02:05,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:02:05,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343743329] [2023-08-30 00:02:05,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:02:05,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:02:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:02:05,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:02:05,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:02:05,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:02:05,781 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-08-30 00:02:05,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:02:05,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:02:05,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:02:13,671 INFO L130 PetriNetUnfolder]: 37747/55963 cut-off events. [2023-08-30 00:02:13,671 INFO L131 PetriNetUnfolder]: For 800880/807523 co-relation queries the response was YES. [2023-08-30 00:02:14,349 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-08-30 00:02:14,533 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 474 selfloop transitions, 61 changer transitions 36/606 dead transitions. [2023-08-30 00:02:14,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 606 transitions, 11486 flow [2023-08-30 00:02:14,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 00:02:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 00:02:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2023-08-30 00:02:14,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47752808988764045 [2023-08-30 00:02:14,534 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2023-08-30 00:02:14,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2023-08-30 00:02:14,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:02:14,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2023-08-30 00:02:14,537 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-08-30 00:02:14,539 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-08-30 00:02:14,539 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-08-30 00:02:14,539 INFO L175 Difference]: Start difference. First operand has 144 places, 242 transitions, 4318 flow. Second operand 6 states and 765 transitions. [2023-08-30 00:02:14,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 606 transitions, 11486 flow [2023-08-30 00:02:18,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 606 transitions, 11367 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 00:02:18,680 INFO L231 Difference]: Finished difference. Result has 152 places, 292 transitions, 5448 flow [2023-08-30 00:02:18,680 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-08-30 00:02:18,681 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 97 predicate places. [2023-08-30 00:02:18,681 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 292 transitions, 5448 flow [2023-08-30 00:02:18,681 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-08-30 00:02:18,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:02:18,682 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-08-30 00:02:18,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-30 00:02:18,682 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-08-30 00:02:18,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:02:18,683 INFO L85 PathProgramCache]: Analyzing trace with hash -868880549, now seen corresponding path program 5 times [2023-08-30 00:02:18,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:02:18,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980779528] [2023-08-30 00:02:18,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:02:18,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:02:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:02:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:02:18,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:02:18,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980779528] [2023-08-30 00:02:18,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980779528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:02:18,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:02:18,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:02:18,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398330215] [2023-08-30 00:02:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:02:18,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:02:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:02:18,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:02:18,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:02:18,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 00:02:18,771 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-08-30 00:02:18,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:02:18,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 00:02:18,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:02:27,613 INFO L130 PetriNetUnfolder]: 38974/58937 cut-off events. [2023-08-30 00:02:27,613 INFO L131 PetriNetUnfolder]: For 946683/952430 co-relation queries the response was YES. [2023-08-30 00:02:28,297 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-08-30 00:02:28,477 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 295 selfloop transitions, 87 changer transitions 18/435 dead transitions. [2023-08-30 00:02:28,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 435 transitions, 8277 flow [2023-08-30 00:02:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:02:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:02:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-30 00:02:28,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853932584269663 [2023-08-30 00:02:28,478 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-30 00:02:28,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-30 00:02:28,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:02:28,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-30 00:02:28,480 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-08-30 00:02:28,481 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-08-30 00:02:28,481 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-08-30 00:02:28,481 INFO L175 Difference]: Start difference. First operand has 152 places, 292 transitions, 5448 flow. Second operand 5 states and 648 transitions. [2023-08-30 00:02:28,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 435 transitions, 8277 flow [2023-08-30 00:02:35,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 435 transitions, 8224 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-30 00:02:35,262 INFO L231 Difference]: Finished difference. Result has 157 places, 295 transitions, 5657 flow [2023-08-30 00:02:35,262 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-08-30 00:02:35,263 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 102 predicate places. [2023-08-30 00:02:35,263 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 295 transitions, 5657 flow [2023-08-30 00:02:35,263 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-08-30 00:02:35,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:02:35,263 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-08-30 00:02:35,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-30 00:02:35,263 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-08-30 00:02:35,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:02:35,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1163998239, now seen corresponding path program 5 times [2023-08-30 00:02:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:02:35,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510043157] [2023-08-30 00:02:35,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:02:35,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:02:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:02:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:02:35,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:02:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510043157] [2023-08-30 00:02:35,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510043157] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:02:35,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:02:35,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:02:35,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574137561] [2023-08-30 00:02:35,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:02:35,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:02:35,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:02:35,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:02:35,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:02:35,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 00:02:35,345 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-08-30 00:02:35,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:02:35,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 00:02:35,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:02:44,639 INFO L130 PetriNetUnfolder]: 38801/59204 cut-off events. [2023-08-30 00:02:44,639 INFO L131 PetriNetUnfolder]: For 1016268/1023002 co-relation queries the response was YES. [2023-08-30 00:02:45,473 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-08-30 00:02:45,676 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 306 selfloop transitions, 66 changer transitions 21/425 dead transitions. [2023-08-30 00:02:45,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 425 transitions, 8141 flow [2023-08-30 00:02:45,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:02:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:02:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-30 00:02:45,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898876404494382 [2023-08-30 00:02:45,677 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-30 00:02:45,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-30 00:02:45,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:02:45,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-30 00:02:45,678 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-08-30 00:02:45,679 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-08-30 00:02:45,680 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-08-30 00:02:45,680 INFO L175 Difference]: Start difference. First operand has 157 places, 295 transitions, 5657 flow. Second operand 5 states and 654 transitions. [2023-08-30 00:02:45,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 425 transitions, 8141 flow [2023-08-30 00:02:51,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 425 transitions, 7887 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 00:02:51,507 INFO L231 Difference]: Finished difference. Result has 161 places, 300 transitions, 5771 flow [2023-08-30 00:02:51,508 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-08-30 00:02:51,508 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 106 predicate places. [2023-08-30 00:02:51,509 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 300 transitions, 5771 flow [2023-08-30 00:02:51,509 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-08-30 00:02:51,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:02:51,509 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-08-30 00:02:51,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-30 00:02:51,509 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-08-30 00:02:51,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:02:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash 130711419, now seen corresponding path program 6 times [2023-08-30 00:02:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:02:51,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93447341] [2023-08-30 00:02:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:02:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:02:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:02:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:02:51,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:02:51,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93447341] [2023-08-30 00:02:51,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93447341] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:02:51,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:02:51,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:02:51,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315078362] [2023-08-30 00:02:51,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:02:51,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:02:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:02:51,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:02:51,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:02:51,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:02:51,606 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-08-30 00:02:51,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:02:51,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:02:51,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:03:01,070 INFO L130 PetriNetUnfolder]: 38036/58263 cut-off events. [2023-08-30 00:03:01,070 INFO L131 PetriNetUnfolder]: For 1017847/1024181 co-relation queries the response was YES. [2023-08-30 00:03:01,938 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-08-30 00:03:02,119 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 289 selfloop transitions, 124 changer transitions 23/469 dead transitions. [2023-08-30 00:03:02,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 469 transitions, 9326 flow [2023-08-30 00:03:02,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:03:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:03:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-30 00:03:02,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48389513108614235 [2023-08-30 00:03:02,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-30 00:03:02,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-30 00:03:02,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:03:02,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-30 00:03:02,122 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-08-30 00:03:02,123 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-08-30 00:03:02,123 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-08-30 00:03:02,123 INFO L175 Difference]: Start difference. First operand has 161 places, 300 transitions, 5771 flow. Second operand 5 states and 646 transitions. [2023-08-30 00:03:02,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 469 transitions, 9326 flow [2023-08-30 00:03:10,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 469 transitions, 9146 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 00:03:10,372 INFO L231 Difference]: Finished difference. Result has 166 places, 333 transitions, 6739 flow [2023-08-30 00:03:10,372 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-08-30 00:03:10,373 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 111 predicate places. [2023-08-30 00:03:10,373 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 333 transitions, 6739 flow [2023-08-30 00:03:10,373 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-08-30 00:03:10,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:03:10,374 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-08-30 00:03:10,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-30 00:03:10,374 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-08-30 00:03:10,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:03:10,375 INFO L85 PathProgramCache]: Analyzing trace with hash 743299887, now seen corresponding path program 7 times [2023-08-30 00:03:10,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:03:10,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975725730] [2023-08-30 00:03:10,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:03:10,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:03:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:03:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:03:10,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:03:10,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975725730] [2023-08-30 00:03:10,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975725730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:03:10,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:03:10,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:03:10,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557857816] [2023-08-30 00:03:10,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:03:10,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:03:10,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:03:10,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:03:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:03:10,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:03:10,479 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-08-30 00:03:10,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:03:10,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:03:10,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:03:21,398 INFO L130 PetriNetUnfolder]: 41241/63199 cut-off events. [2023-08-30 00:03:21,399 INFO L131 PetriNetUnfolder]: For 1149652/1152390 co-relation queries the response was YES. [2023-08-30 00:03:22,647 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-08-30 00:03:23,167 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 475 selfloop transitions, 107 changer transitions 51/675 dead transitions. [2023-08-30 00:03:23,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 675 transitions, 13778 flow [2023-08-30 00:03:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 00:03:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 00:03:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions. [2023-08-30 00:03:23,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787765293383271 [2023-08-30 00:03:23,168 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 767 transitions. [2023-08-30 00:03:23,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions. [2023-08-30 00:03:23,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:03:23,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions. [2023-08-30 00:03:23,169 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-08-30 00:03:23,170 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-08-30 00:03:23,170 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-08-30 00:03:23,170 INFO L175 Difference]: Start difference. First operand has 166 places, 333 transitions, 6739 flow. Second operand 6 states and 767 transitions. [2023-08-30 00:03:23,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 675 transitions, 13778 flow [2023-08-30 00:03:39,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 675 transitions, 13446 flow, removed 100 selfloop flow, removed 1 redundant places. [2023-08-30 00:03:39,023 INFO L231 Difference]: Finished difference. Result has 174 places, 411 transitions, 8510 flow [2023-08-30 00:03:39,023 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-08-30 00:03:39,024 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 119 predicate places. [2023-08-30 00:03:39,024 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 411 transitions, 8510 flow [2023-08-30 00:03:39,024 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-08-30 00:03:39,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:03:39,024 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-08-30 00:03:39,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-30 00:03:39,025 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-08-30 00:03:39,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:03:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash -66814013, now seen corresponding path program 8 times [2023-08-30 00:03:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:03:39,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886597792] [2023-08-30 00:03:39,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:03:39,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:03:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:03:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:03:39,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:03:39,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886597792] [2023-08-30 00:03:39,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886597792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:03:39,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:03:39,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:03:39,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253689886] [2023-08-30 00:03:39,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:03:39,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:03:39,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:03:39,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:03:39,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:03:39,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 00:03:39,114 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-08-30 00:03:39,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:03:39,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 00:03:39,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:03:50,766 INFO L130 PetriNetUnfolder]: 42085/65879 cut-off events. [2023-08-30 00:03:50,766 INFO L131 PetriNetUnfolder]: For 1335174/1337781 co-relation queries the response was YES. [2023-08-30 00:03:51,659 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-08-30 00:03:51,865 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 334 selfloop transitions, 159 changer transitions 24/559 dead transitions. [2023-08-30 00:03:51,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 559 transitions, 11756 flow [2023-08-30 00:03:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:03:51,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:03:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-30 00:03:51,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48389513108614235 [2023-08-30 00:03:51,867 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-30 00:03:51,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-30 00:03:51,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:03:51,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-30 00:03:51,868 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-08-30 00:03:51,868 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-08-30 00:03:51,869 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-08-30 00:03:51,869 INFO L175 Difference]: Start difference. First operand has 174 places, 411 transitions, 8510 flow. Second operand 5 states and 646 transitions. [2023-08-30 00:03:51,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 559 transitions, 11756 flow [2023-08-30 00:04:08,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 559 transitions, 11658 flow, removed 49 selfloop flow, removed 0 redundant places. [2023-08-30 00:04:08,198 INFO L231 Difference]: Finished difference. Result has 180 places, 415 transitions, 8882 flow [2023-08-30 00:04:08,198 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-08-30 00:04:08,199 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 125 predicate places. [2023-08-30 00:04:08,199 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 415 transitions, 8882 flow [2023-08-30 00:04:08,199 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-08-30 00:04:08,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:04:08,199 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-08-30 00:04:08,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-30 00:04:08,200 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-08-30 00:04:08,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:04:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1328780872, now seen corresponding path program 7 times [2023-08-30 00:04:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:04:08,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445718018] [2023-08-30 00:04:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:04:08,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:04:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:04:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:04:08,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:04:08,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445718018] [2023-08-30 00:04:08,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445718018] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:04:08,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741006038] [2023-08-30 00:04:08,252 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 00:04:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:04:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:04:08,259 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-08-30 00:04:08,260 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-08-30 00:04:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:04:08,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:04:08,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:04:08,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-08-30 00:04:08,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:04:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:04:08,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741006038] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:04:08,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:04:08,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 00:04:08,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692341887] [2023-08-30 00:04:08,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:04:08,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 00:04:08,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:04:08,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 00:04:08,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 00:04:08,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:04:08,505 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-08-30 00:04:08,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:04:08,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:04:08,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:04:20,281 INFO L130 PetriNetUnfolder]: 41884/64809 cut-off events. [2023-08-30 00:04:20,281 INFO L131 PetriNetUnfolder]: For 1465135/1467569 co-relation queries the response was YES. [2023-08-30 00:04:21,247 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-08-30 00:04:21,447 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 366 selfloop transitions, 151 changer transitions 13/572 dead transitions. [2023-08-30 00:04:21,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 572 transitions, 12601 flow [2023-08-30 00:04:21,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:04:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:04:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-30 00:04:21,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4764044943820225 [2023-08-30 00:04:21,449 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-30 00:04:21,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-30 00:04:21,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:04:21,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-30 00:04:21,450 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-08-30 00:04:21,450 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-08-30 00:04:21,450 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-08-30 00:04:21,451 INFO L175 Difference]: Start difference. First operand has 180 places, 415 transitions, 8882 flow. Second operand 5 states and 636 transitions. [2023-08-30 00:04:21,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 572 transitions, 12601 flow [2023-08-30 00:04:35,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 572 transitions, 12285 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-30 00:04:35,954 INFO L231 Difference]: Finished difference. Result has 184 places, 428 transitions, 9325 flow [2023-08-30 00:04:35,955 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-08-30 00:04:35,955 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 129 predicate places. [2023-08-30 00:04:35,955 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 428 transitions, 9325 flow [2023-08-30 00:04:35,955 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-08-30 00:04:35,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:04:35,956 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-08-30 00:04:35,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-30 00:04:36,159 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-08-30 00:04:36,160 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-08-30 00:04:36,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:04:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash 154314935, now seen corresponding path program 6 times [2023-08-30 00:04:36,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:04:36,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722989478] [2023-08-30 00:04:36,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:04:36,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:04:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:04:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:04:36,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:04:36,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722989478] [2023-08-30 00:04:36,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722989478] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:04:36,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:04:36,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:04:36,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786578879] [2023-08-30 00:04:36,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:04:36,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:04:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:04:36,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:04:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:04:36,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:04:36,242 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-08-30 00:04:36,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:04:36,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:04:36,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:04:47,515 INFO L130 PetriNetUnfolder]: 37676/57590 cut-off events. [2023-08-30 00:04:47,515 INFO L131 PetriNetUnfolder]: For 1424177/1429240 co-relation queries the response was YES. [2023-08-30 00:04:48,457 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-08-30 00:04:48,640 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 413 selfloop transitions, 95 changer transitions 29/597 dead transitions. [2023-08-30 00:04:48,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 597 transitions, 13010 flow [2023-08-30 00:04:48,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:04:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:04:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-30 00:04:48,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883895131086142 [2023-08-30 00:04:48,642 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-30 00:04:48,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-30 00:04:48,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:04:48,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-30 00:04:48,643 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-08-30 00:04:48,644 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-08-30 00:04:48,644 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-08-30 00:04:48,644 INFO L175 Difference]: Start difference. First operand has 184 places, 428 transitions, 9325 flow. Second operand 5 states and 652 transitions. [2023-08-30 00:04:48,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 597 transitions, 13010 flow [2023-08-30 00:04:57,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 597 transitions, 12768 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-08-30 00:04:57,821 INFO L231 Difference]: Finished difference. Result has 187 places, 436 transitions, 9545 flow [2023-08-30 00:04:57,821 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-08-30 00:04:57,821 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 132 predicate places. [2023-08-30 00:04:57,821 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 436 transitions, 9545 flow [2023-08-30 00:04:57,822 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-08-30 00:04:57,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:04:57,822 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-08-30 00:04:57,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-30 00:04:57,822 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-08-30 00:04:57,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:04:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash 339540687, now seen corresponding path program 9 times [2023-08-30 00:04:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:04:57,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716004674] [2023-08-30 00:04:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:04:57,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:04:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:04:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:04:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:04:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716004674] [2023-08-30 00:04:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716004674] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:04:57,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:04:57,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:04:57,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836726729] [2023-08-30 00:04:57,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:04:57,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:04:57,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:04:57,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:04:57,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:04:57,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:04:57,903 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-08-30 00:04:57,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:04:57,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:04:57,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:05:08,707 INFO L130 PetriNetUnfolder]: 36626/56604 cut-off events. [2023-08-30 00:05:08,708 INFO L131 PetriNetUnfolder]: For 1358527/1361703 co-relation queries the response was YES. [2023-08-30 00:05:09,660 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-08-30 00:05:09,851 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 360 selfloop transitions, 204 changer transitions 37/640 dead transitions. [2023-08-30 00:05:09,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 640 transitions, 14544 flow [2023-08-30 00:05:09,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:05:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:05:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-08-30 00:05:09,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48239700374531835 [2023-08-30 00:05:09,852 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-08-30 00:05:09,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-08-30 00:05:09,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:05:09,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-08-30 00:05:09,853 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-08-30 00:05:09,854 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-08-30 00:05:09,854 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-08-30 00:05:09,854 INFO L175 Difference]: Start difference. First operand has 187 places, 436 transitions, 9545 flow. Second operand 5 states and 644 transitions. [2023-08-30 00:05:09,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 640 transitions, 14544 flow [2023-08-30 00:05:21,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 640 transitions, 14232 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-08-30 00:05:21,534 INFO L231 Difference]: Finished difference. Result has 191 places, 495 transitions, 11489 flow [2023-08-30 00:05:21,534 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-08-30 00:05:21,534 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 136 predicate places. [2023-08-30 00:05:21,534 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 495 transitions, 11489 flow [2023-08-30 00:05:21,535 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-08-30 00:05:21,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:05:21,535 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-08-30 00:05:21,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-30 00:05:21,535 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-08-30 00:05:21,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:05:21,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1365040330, now seen corresponding path program 8 times [2023-08-30 00:05:21,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:05:21,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774864402] [2023-08-30 00:05:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:05:21,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:05:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:05:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:05:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:05:21,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774864402] [2023-08-30 00:05:21,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774864402] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:05:21,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913964882] [2023-08-30 00:05:21,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 00:05:21,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:05:21,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:05:21,593 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-08-30 00:05:21,601 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-08-30 00:05:21,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 00:05:21,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:05:21,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:05:21,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:05:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:05:21,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:05:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:05:21,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913964882] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:05:21,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:05:21,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 00:05:21,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35476087] [2023-08-30 00:05:21,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:05:21,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:05:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:05:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:05:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:05:21,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:05:21,867 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-08-30 00:05:21,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:05:21,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:05:21,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:05:33,916 INFO L130 PetriNetUnfolder]: 38085/58383 cut-off events. [2023-08-30 00:05:33,916 INFO L131 PetriNetUnfolder]: For 1459002/1462246 co-relation queries the response was YES. [2023-08-30 00:05:34,924 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-08-30 00:05:35,134 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 494 selfloop transitions, 224 changer transitions 40/797 dead transitions. [2023-08-30 00:05:35,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 797 transitions, 18278 flow [2023-08-30 00:05:35,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 00:05:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 00:05:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1017 transitions. [2023-08-30 00:05:35,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.476123595505618 [2023-08-30 00:05:35,136 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1017 transitions. [2023-08-30 00:05:35,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1017 transitions. [2023-08-30 00:05:35,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:05:35,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1017 transitions. [2023-08-30 00:05:35,137 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-08-30 00:05:35,138 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-08-30 00:05:35,138 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-08-30 00:05:35,138 INFO L175 Difference]: Start difference. First operand has 191 places, 495 transitions, 11489 flow. Second operand 8 states and 1017 transitions. [2023-08-30 00:05:35,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 797 transitions, 18278 flow [2023-08-30 00:05:49,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 797 transitions, 17880 flow, removed 115 selfloop flow, removed 1 redundant places. [2023-08-30 00:05:49,881 INFO L231 Difference]: Finished difference. Result has 199 places, 512 transitions, 12023 flow [2023-08-30 00:05:49,881 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-08-30 00:05:49,881 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 144 predicate places. [2023-08-30 00:05:49,882 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 512 transitions, 12023 flow [2023-08-30 00:05:49,882 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-08-30 00:05:49,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:05:49,882 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-08-30 00:05:49,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-30 00:05:50,082 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-08-30 00:05:50,083 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-08-30 00:05:50,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:05:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash 753687983, now seen corresponding path program 10 times [2023-08-30 00:05:50,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:05:50,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670832741] [2023-08-30 00:05:50,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:05:50,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:05:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:05:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:05:50,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:05:50,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670832741] [2023-08-30 00:05:50,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670832741] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:05:50,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:05:50,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:05:50,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024343415] [2023-08-30 00:05:50,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:05:50,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:05:50,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:05:50,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:05:50,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:05:50,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:05:50,176 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-08-30 00:05:50,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:05:50,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:05:50,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:06:01,994 INFO L130 PetriNetUnfolder]: 37323/57241 cut-off events. [2023-08-30 00:06:01,994 INFO L131 PetriNetUnfolder]: For 1510642/1515530 co-relation queries the response was YES. [2023-08-30 00:06:02,951 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-08-30 00:06:03,136 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 458 selfloop transitions, 183 changer transitions 72/769 dead transitions. [2023-08-30 00:06:03,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 769 transitions, 18118 flow [2023-08-30 00:06:03,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 00:06:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 00:06:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2023-08-30 00:06:03,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4762796504369538 [2023-08-30 00:06:03,138 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2023-08-30 00:06:03,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2023-08-30 00:06:03,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:06:03,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2023-08-30 00:06:03,139 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-08-30 00:06:03,140 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-08-30 00:06:03,140 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-08-30 00:06:03,140 INFO L175 Difference]: Start difference. First operand has 199 places, 512 transitions, 12023 flow. Second operand 6 states and 763 transitions. [2023-08-30 00:06:03,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 769 transitions, 18118 flow [2023-08-30 00:06:17,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 769 transitions, 17548 flow, removed 43 selfloop flow, removed 5 redundant places. [2023-08-30 00:06:17,227 INFO L231 Difference]: Finished difference. Result has 203 places, 578 transitions, 13692 flow [2023-08-30 00:06:17,227 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-08-30 00:06:17,234 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 148 predicate places. [2023-08-30 00:06:17,234 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 578 transitions, 13692 flow [2023-08-30 00:06:17,234 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-08-30 00:06:17,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:06:17,234 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-08-30 00:06:17,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-08-30 00:06:17,235 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-08-30 00:06:17,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:06:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash 780929349, now seen corresponding path program 11 times [2023-08-30 00:06:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:06:17,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942857375] [2023-08-30 00:06:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:06:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:06:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:06:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:06:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:06:17,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942857375] [2023-08-30 00:06:17,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942857375] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:06:17,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:06:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:06:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075216864] [2023-08-30 00:06:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:06:17,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:06:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:06:17,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:06:17,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:06:17,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:06:17,324 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-08-30 00:06:17,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:06:17,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:06:17,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:06:31,081 INFO L130 PetriNetUnfolder]: 37664/57098 cut-off events. [2023-08-30 00:06:31,081 INFO L131 PetriNetUnfolder]: For 1600579/1603822 co-relation queries the response was YES. [2023-08-30 00:06:32,204 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-08-30 00:06:32,417 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 515 selfloop transitions, 159 changer transitions 26/756 dead transitions. [2023-08-30 00:06:32,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 756 transitions, 18493 flow [2023-08-30 00:06:32,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:06:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:06:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-08-30 00:06:32,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48089887640449436 [2023-08-30 00:06:32,418 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-08-30 00:06:32,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-08-30 00:06:32,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:06:32,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-08-30 00:06:32,419 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-08-30 00:06:32,420 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-08-30 00:06:32,420 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-08-30 00:06:32,420 INFO L175 Difference]: Start difference. First operand has 203 places, 578 transitions, 13692 flow. Second operand 5 states and 642 transitions. [2023-08-30 00:06:32,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 756 transitions, 18493 flow [2023-08-30 00:06:48,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 756 transitions, 18271 flow, removed 111 selfloop flow, removed 0 redundant places. [2023-08-30 00:06:48,058 INFO L231 Difference]: Finished difference. Result has 208 places, 598 transitions, 14351 flow [2023-08-30 00:06:48,059 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-08-30 00:06:48,059 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 153 predicate places. [2023-08-30 00:06:48,060 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 598 transitions, 14351 flow [2023-08-30 00:06:48,060 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-08-30 00:06:48,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:06:48,060 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-08-30 00:06:48,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-08-30 00:06:48,060 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-08-30 00:06:48,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:06:48,061 INFO L85 PathProgramCache]: Analyzing trace with hash 34021147, now seen corresponding path program 12 times [2023-08-30 00:06:48,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:06:48,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623217154] [2023-08-30 00:06:48,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:06:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:06:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:06:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:06:48,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:06:48,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623217154] [2023-08-30 00:06:48,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623217154] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:06:48,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:06:48,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:06:48,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145892136] [2023-08-30 00:06:48,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:06:48,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:06:48,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:06:48,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:06:48,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:06:48,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:06:48,146 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-08-30 00:06:48,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:06:48,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:06:48,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:07:01,921 INFO L130 PetriNetUnfolder]: 40033/60338 cut-off events. [2023-08-30 00:07:01,921 INFO L131 PetriNetUnfolder]: For 1706625/1709374 co-relation queries the response was YES. [2023-08-30 00:07:03,092 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-08-30 00:07:03,317 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 483 selfloop transitions, 219 changer transitions 24/770 dead transitions. [2023-08-30 00:07:03,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 770 transitions, 19093 flow [2023-08-30 00:07:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:07:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:07:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-08-30 00:07:03,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48089887640449436 [2023-08-30 00:07:03,319 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-08-30 00:07:03,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-08-30 00:07:03,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:07:03,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-08-30 00:07:03,320 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-08-30 00:07:03,321 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-08-30 00:07:03,321 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-08-30 00:07:03,321 INFO L175 Difference]: Start difference. First operand has 208 places, 598 transitions, 14351 flow. Second operand 5 states and 642 transitions. [2023-08-30 00:07:03,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 770 transitions, 19093 flow [2023-08-30 00:07:20,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 770 transitions, 18679 flow, removed 26 selfloop flow, removed 3 redundant places. [2023-08-30 00:07:20,547 INFO L231 Difference]: Finished difference. Result has 210 places, 626 transitions, 15244 flow [2023-08-30 00:07:20,548 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-08-30 00:07:20,548 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 155 predicate places. [2023-08-30 00:07:20,548 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 626 transitions, 15244 flow [2023-08-30 00:07:20,548 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-08-30 00:07:20,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:07:20,549 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-08-30 00:07:20,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-08-30 00:07:20,549 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-08-30 00:07:20,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:07:20,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1102447902, now seen corresponding path program 9 times [2023-08-30 00:07:20,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:07:20,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078377417] [2023-08-30 00:07:20,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:07:20,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:07:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:07:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:07:20,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:07:20,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078377417] [2023-08-30 00:07:20,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078377417] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:07:20,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049257815] [2023-08-30 00:07:20,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 00:07:20,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:07:20,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:07:20,607 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-08-30 00:07:20,609 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-08-30 00:07:20,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 00:07:20,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:07:20,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:07:20,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:07:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:07:20,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:07:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:07:20,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049257815] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:07:20,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:07:20,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 00:07:20,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118105320] [2023-08-30 00:07:20,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:07:20,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:07:20,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:07:20,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:07:20,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:07:20,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:07:20,873 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-08-30 00:07:20,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:07:20,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:07:20,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:07:33,742 INFO L130 PetriNetUnfolder]: 38509/58104 cut-off events. [2023-08-30 00:07:33,742 INFO L131 PetriNetUnfolder]: For 1720360/1723990 co-relation queries the response was YES. [2023-08-30 00:07:34,945 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-08-30 00:07:35,134 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 525 selfloop transitions, 171 changer transitions 37/773 dead transitions. [2023-08-30 00:07:35,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 773 transitions, 19388 flow [2023-08-30 00:07:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:07:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:07:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-08-30 00:07:35,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4771535580524345 [2023-08-30 00:07:35,135 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-08-30 00:07:35,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-08-30 00:07:35,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:07:35,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-08-30 00:07:35,137 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-08-30 00:07:35,138 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-08-30 00:07:35,138 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-08-30 00:07:35,138 INFO L175 Difference]: Start difference. First operand has 210 places, 626 transitions, 15244 flow. Second operand 5 states and 637 transitions. [2023-08-30 00:07:35,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 773 transitions, 19388 flow [2023-08-30 00:07:49,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 773 transitions, 18810 flow, removed 70 selfloop flow, removed 3 redundant places. [2023-08-30 00:07:49,882 INFO L231 Difference]: Finished difference. Result has 212 places, 617 transitions, 14932 flow [2023-08-30 00:07:49,882 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-08-30 00:07:49,882 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 157 predicate places. [2023-08-30 00:07:49,882 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 617 transitions, 14932 flow [2023-08-30 00:07:49,883 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-08-30 00:07:49,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:07:49,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:07:49,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-30 00:07:50,083 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-08-30 00:07:50,084 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-08-30 00:07:50,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:07:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash -462565781, now seen corresponding path program 13 times [2023-08-30 00:07:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:07:50,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640236980] [2023-08-30 00:07:50,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:07:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:07:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:07:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:07:50,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:07:50,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640236980] [2023-08-30 00:07:50,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640236980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:07:50,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:07:50,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:07:50,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087084404] [2023-08-30 00:07:50,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:07:50,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:07:50,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:07:50,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:07:50,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:07:50,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:07:50,162 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-08-30 00:07:50,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:07:50,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:07:50,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:08:01,913 INFO L130 PetriNetUnfolder]: 34574/51530 cut-off events. [2023-08-30 00:08:01,913 INFO L131 PetriNetUnfolder]: For 1515816/1519201 co-relation queries the response was YES. [2023-08-30 00:08:03,001 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-08-30 00:08:03,203 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 511 selfloop transitions, 199 changer transitions 27/771 dead transitions. [2023-08-30 00:08:03,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 771 transitions, 19281 flow [2023-08-30 00:08:03,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:08:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:08:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-08-30 00:08:03,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794007490636704 [2023-08-30 00:08:03,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-08-30 00:08:03,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-08-30 00:08:03,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:08:03,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-08-30 00:08:03,205 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-08-30 00:08:03,206 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-08-30 00:08:03,206 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-08-30 00:08:03,206 INFO L175 Difference]: Start difference. First operand has 212 places, 617 transitions, 14932 flow. Second operand 5 states and 640 transitions. [2023-08-30 00:08:03,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 771 transitions, 19281 flow [2023-08-30 00:08:17,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 771 transitions, 18907 flow, removed 93 selfloop flow, removed 2 redundant places. [2023-08-30 00:08:17,094 INFO L231 Difference]: Finished difference. Result has 215 places, 624 transitions, 15327 flow [2023-08-30 00:08:17,095 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-08-30 00:08:17,095 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 160 predicate places. [2023-08-30 00:08:17,095 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 624 transitions, 15327 flow [2023-08-30 00:08:17,096 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-08-30 00:08:17,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:08:17,096 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-08-30 00:08:17,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-08-30 00:08:17,096 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-08-30 00:08:17,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:08:17,097 INFO L85 PathProgramCache]: Analyzing trace with hash -482494160, now seen corresponding path program 6 times [2023-08-30 00:08:17,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:08:17,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144292199] [2023-08-30 00:08:17,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:08:17,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:08:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:08:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:08:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:08:17,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144292199] [2023-08-30 00:08:17,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144292199] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:08:17,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016836037] [2023-08-30 00:08:17,154 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 00:08:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:08:17,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:08:17,156 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-08-30 00:08:17,158 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-08-30 00:08:17,281 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-30 00:08:17,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:08:17,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:08:17,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:08:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:08:17,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:08:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:08:17,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016836037] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:08:17,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:08:17,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 00:08:17,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428818726] [2023-08-30 00:08:17,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:08:17,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:08:17,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:08:17,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:08:17,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:08:17,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:08:17,417 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-08-30 00:08:17,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:08:17,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:08:17,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:08:28,326 INFO L130 PetriNetUnfolder]: 33421/48947 cut-off events. [2023-08-30 00:08:28,326 INFO L131 PetriNetUnfolder]: For 1457129/1463548 co-relation queries the response was YES. [2023-08-30 00:08:29,327 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-08-30 00:08:29,526 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 707 selfloop transitions, 162 changer transitions 87/1017 dead transitions. [2023-08-30 00:08:29,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 1017 transitions, 25390 flow [2023-08-30 00:08:29,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 00:08:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 00:08:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1025 transitions. [2023-08-30 00:08:29,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798689138576779 [2023-08-30 00:08:29,528 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1025 transitions. [2023-08-30 00:08:29,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1025 transitions. [2023-08-30 00:08:29,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:08:29,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1025 transitions. [2023-08-30 00:08:29,529 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-08-30 00:08:29,530 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-08-30 00:08:29,531 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-08-30 00:08:29,531 INFO L175 Difference]: Start difference. First operand has 215 places, 624 transitions, 15327 flow. Second operand 8 states and 1025 transitions. [2023-08-30 00:08:29,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 1017 transitions, 25390 flow [2023-08-30 00:08:39,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1017 transitions, 24188 flow, removed 153 selfloop flow, removed 5 redundant places. [2023-08-30 00:08:39,610 INFO L231 Difference]: Finished difference. Result has 218 places, 646 transitions, 15535 flow [2023-08-30 00:08:39,611 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-08-30 00:08:39,611 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 163 predicate places. [2023-08-30 00:08:39,611 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 646 transitions, 15535 flow [2023-08-30 00:08:39,611 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-08-30 00:08:39,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:08:39,611 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-08-30 00:08:39,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-30 00:08:39,812 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-08-30 00:08:39,813 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-08-30 00:08:39,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:08:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash -413986243, now seen corresponding path program 7 times [2023-08-30 00:08:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:08:39,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881312128] [2023-08-30 00:08:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:08:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:08:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:08:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:08:39,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:08:39,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881312128] [2023-08-30 00:08:39,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881312128] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:08:39,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:08:39,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:08:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819495245] [2023-08-30 00:08:39,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:08:39,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:08:39,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:08:39,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:08:39,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:08:39,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:08:39,888 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-08-30 00:08:39,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:08:39,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:08:39,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:08:50,142 INFO L130 PetriNetUnfolder]: 31341/45428 cut-off events. [2023-08-30 00:08:50,142 INFO L131 PetriNetUnfolder]: For 1287985/1291702 co-relation queries the response was YES. [2023-08-30 00:08:50,905 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-08-30 00:08:51,073 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 512 selfloop transitions, 193 changer transitions 89/831 dead transitions. [2023-08-30 00:08:51,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 831 transitions, 20521 flow [2023-08-30 00:08:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 00:08:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 00:08:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2023-08-30 00:08:51,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48252184769038703 [2023-08-30 00:08:51,077 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2023-08-30 00:08:51,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2023-08-30 00:08:51,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:08:51,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2023-08-30 00:08:51,078 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-08-30 00:08:51,079 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-08-30 00:08:51,079 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-08-30 00:08:51,080 INFO L175 Difference]: Start difference. First operand has 218 places, 646 transitions, 15535 flow. Second operand 6 states and 773 transitions. [2023-08-30 00:08:51,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 831 transitions, 20521 flow [2023-08-30 00:09:00,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 831 transitions, 19980 flow, removed 96 selfloop flow, removed 7 redundant places. [2023-08-30 00:09:00,389 INFO L231 Difference]: Finished difference. Result has 217 places, 640 transitions, 15347 flow [2023-08-30 00:09:00,390 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-08-30 00:09:00,390 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 162 predicate places. [2023-08-30 00:09:00,390 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 640 transitions, 15347 flow [2023-08-30 00:09:00,390 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-08-30 00:09:00,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:09:00,391 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-08-30 00:09:00,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-08-30 00:09:00,391 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-08-30 00:09:00,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:09:00,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1838366115, now seen corresponding path program 8 times [2023-08-30 00:09:00,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:09:00,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988896587] [2023-08-30 00:09:00,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:09:00,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:09:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:09:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:09:00,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:09:00,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988896587] [2023-08-30 00:09:00,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988896587] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:09:00,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126469862] [2023-08-30 00:09:00,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 00:09:00,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:09:00,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:09:00,445 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-08-30 00:09:00,452 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-08-30 00:09:00,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 00:09:00,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:09:00,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:09:00,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:09:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:09:00,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:09:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:09:00,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126469862] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:09:00,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:09:00,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 00:09:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494020290] [2023-08-30 00:09:00,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:09:00,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:09:00,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:09:00,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:09:00,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:09:00,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:09:00,714 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-08-30 00:09:00,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:09:00,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:09:00,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:09:10,827 INFO L130 PetriNetUnfolder]: 33169/47217 cut-off events. [2023-08-30 00:09:10,827 INFO L131 PetriNetUnfolder]: For 1290611/1293488 co-relation queries the response was YES. [2023-08-30 00:09:11,652 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-08-30 00:09:11,842 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 602 selfloop transitions, 250 changer transitions 113/1010 dead transitions. [2023-08-30 00:09:11,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 1010 transitions, 24591 flow [2023-08-30 00:09:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 00:09:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 00:09:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1019 transitions. [2023-08-30 00:09:11,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477059925093633 [2023-08-30 00:09:11,844 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1019 transitions. [2023-08-30 00:09:11,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1019 transitions. [2023-08-30 00:09:11,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:09:11,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1019 transitions. [2023-08-30 00:09:11,845 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-08-30 00:09:11,847 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-08-30 00:09:11,847 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-08-30 00:09:11,847 INFO L175 Difference]: Start difference. First operand has 217 places, 640 transitions, 15347 flow. Second operand 8 states and 1019 transitions. [2023-08-30 00:09:11,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 1010 transitions, 24591 flow [2023-08-30 00:09:21,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1010 transitions, 23855 flow, removed 85 selfloop flow, removed 7 redundant places. [2023-08-30 00:09:21,180 INFO L231 Difference]: Finished difference. Result has 218 places, 675 transitions, 16245 flow [2023-08-30 00:09:21,180 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-08-30 00:09:21,181 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 163 predicate places. [2023-08-30 00:09:21,181 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 675 transitions, 16245 flow [2023-08-30 00:09:21,181 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-08-30 00:09:21,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:09:21,181 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-08-30 00:09:21,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-30 00:09:21,381 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-08-30 00:09:21,382 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-08-30 00:09:21,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:09:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash 610739002, now seen corresponding path program 7 times [2023-08-30 00:09:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:09:21,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098207351] [2023-08-30 00:09:21,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:09:21,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:09:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:09:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:09:21,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:09:21,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098207351] [2023-08-30 00:09:21,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098207351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:09:21,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:09:21,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:09:21,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783743455] [2023-08-30 00:09:21,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:09:21,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:09:21,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:09:21,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:09:21,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:09:21,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 00:09:21,471 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-08-30 00:09:21,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:09:21,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 00:09:21,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:09:30,486 INFO L130 PetriNetUnfolder]: 29985/41321 cut-off events. [2023-08-30 00:09:30,486 INFO L131 PetriNetUnfolder]: For 1173263/1178687 co-relation queries the response was YES. [2023-08-30 00:09:31,114 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-08-30 00:09:31,283 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 510 selfloop transitions, 166 changer transitions 85/809 dead transitions. [2023-08-30 00:09:31,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 809 transitions, 20086 flow [2023-08-30 00:09:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:09:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:09:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-30 00:09:31,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853932584269663 [2023-08-30 00:09:31,284 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-30 00:09:31,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-30 00:09:31,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:09:31,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-30 00:09:31,285 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-08-30 00:09:31,285 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-08-30 00:09:31,285 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-08-30 00:09:31,286 INFO L175 Difference]: Start difference. First operand has 218 places, 675 transitions, 16245 flow. Second operand 5 states and 648 transitions. [2023-08-30 00:09:31,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 809 transitions, 20086 flow [2023-08-30 00:09:39,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 809 transitions, 19257 flow, removed 180 selfloop flow, removed 8 redundant places. [2023-08-30 00:09:39,179 INFO L231 Difference]: Finished difference. Result has 213 places, 652 transitions, 15289 flow [2023-08-30 00:09:39,180 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-08-30 00:09:39,180 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 158 predicate places. [2023-08-30 00:09:39,180 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 652 transitions, 15289 flow [2023-08-30 00:09:39,180 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-08-30 00:09:39,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:09:39,181 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-08-30 00:09:39,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-08-30 00:09:39,181 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-08-30 00:09:39,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:09:39,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1884746823, now seen corresponding path program 9 times [2023-08-30 00:09:39,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:09:39,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651801338] [2023-08-30 00:09:39,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:09:39,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:09:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:09:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:09:39,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:09:39,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651801338] [2023-08-30 00:09:39,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651801338] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:09:39,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560732265] [2023-08-30 00:09:39,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 00:09:39,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:09:39,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:09:39,241 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-08-30 00:09:39,245 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-08-30 00:09:39,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 00:09:39,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:09:39,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:09:39,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:09:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:09:39,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:09:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:09:39,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560732265] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:09:39,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:09:39,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 00:09:39,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634029112] [2023-08-30 00:09:39,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:09:39,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:09:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:09:39,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:09:39,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:09:39,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:09:39,513 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-08-30 00:09:39,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:09:39,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:09:39,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:09:46,732 INFO L130 PetriNetUnfolder]: 27154/36707 cut-off events. [2023-08-30 00:09:46,732 INFO L131 PetriNetUnfolder]: For 984772/988951 co-relation queries the response was YES. [2023-08-30 00:09:47,450 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-08-30 00:09:47,627 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 464 selfloop transitions, 214 changer transitions 46/764 dead transitions. [2023-08-30 00:09:47,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 764 transitions, 18795 flow [2023-08-30 00:09:47,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:09:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:09:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-08-30 00:09:47,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696629213483146 [2023-08-30 00:09:47,629 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-08-30 00:09:47,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-08-30 00:09:47,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:09:47,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-08-30 00:09:47,630 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-08-30 00:09:47,631 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-08-30 00:09:47,631 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-08-30 00:09:47,631 INFO L175 Difference]: Start difference. First operand has 213 places, 652 transitions, 15289 flow. Second operand 5 states and 627 transitions. [2023-08-30 00:09:47,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 764 transitions, 18795 flow [2023-08-30 00:09:53,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 764 transitions, 18151 flow, removed 154 selfloop flow, removed 5 redundant places. [2023-08-30 00:09:53,502 INFO L231 Difference]: Finished difference. Result has 205 places, 636 transitions, 14768 flow [2023-08-30 00:09:53,503 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-08-30 00:09:53,503 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 150 predicate places. [2023-08-30 00:09:53,503 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 636 transitions, 14768 flow [2023-08-30 00:09:53,503 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-08-30 00:09:53,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:09:53,504 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-08-30 00:09:53,509 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-08-30 00:09:53,704 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-08-30 00:09:53,705 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-08-30 00:09:53,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:09:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1942890753, now seen corresponding path program 1 times [2023-08-30 00:09:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:09:53,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599011473] [2023-08-30 00:09:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:09:53,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:09:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:09:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:09:53,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:09:53,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599011473] [2023-08-30 00:09:53,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599011473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:09:53,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:09:53,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 00:09:53,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795859916] [2023-08-30 00:09:53,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:09:53,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:09:53,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:09:53,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:09:53,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:09:53,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 00:09:53,782 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-08-30 00:09:53,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:09:53,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 00:09:53,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:10:00,339 INFO L130 PetriNetUnfolder]: 26246/34565 cut-off events. [2023-08-30 00:10:00,340 INFO L131 PetriNetUnfolder]: For 820298/823456 co-relation queries the response was YES. [2023-08-30 00:10:00,929 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-08-30 00:10:01,088 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 513 selfloop transitions, 211 changer transitions 8/772 dead transitions. [2023-08-30 00:10:01,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 772 transitions, 18554 flow [2023-08-30 00:10:01,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:10:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:10:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-08-30 00:10:01,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4771535580524345 [2023-08-30 00:10:01,089 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-08-30 00:10:01,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-08-30 00:10:01,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:10:01,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-08-30 00:10:01,090 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-08-30 00:10:01,091 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-08-30 00:10:01,091 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-08-30 00:10:01,091 INFO L175 Difference]: Start difference. First operand has 205 places, 636 transitions, 14768 flow. Second operand 5 states and 637 transitions. [2023-08-30 00:10:01,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 772 transitions, 18554 flow [2023-08-30 00:10:06,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 772 transitions, 17258 flow, removed 197 selfloop flow, removed 21 redundant places. [2023-08-30 00:10:06,732 INFO L231 Difference]: Finished difference. Result has 178 places, 673 transitions, 15036 flow [2023-08-30 00:10:06,732 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-08-30 00:10:06,733 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 123 predicate places. [2023-08-30 00:10:06,733 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 673 transitions, 15036 flow [2023-08-30 00:10:06,733 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-08-30 00:10:06,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:10:06,733 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-08-30 00:10:06,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-08-30 00:10:06,733 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-08-30 00:10:06,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:10:06,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1923507149, now seen corresponding path program 2 times [2023-08-30 00:10:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:10:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311330016] [2023-08-30 00:10:06,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:10:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:10:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:10:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:10:06,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:10:06,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311330016] [2023-08-30 00:10:06,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311330016] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:10:06,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897932881] [2023-08-30 00:10:06,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 00:10:06,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:10:06,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:10:06,801 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-08-30 00:10:06,804 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-08-30 00:10:06,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 00:10:06,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:10:06,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:10:06,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:10:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:10:06,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:10:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:10:07,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897932881] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:10:07,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:10:07,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 00:10:07,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355763764] [2023-08-30 00:10:07,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:10:07,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:10:07,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:10:07,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:10:07,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:10:07,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:10:07,075 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-08-30 00:10:07,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:10:07,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:10:07,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:10:14,344 INFO L130 PetriNetUnfolder]: 31512/41502 cut-off events. [2023-08-30 00:10:14,345 INFO L131 PetriNetUnfolder]: For 911585/914118 co-relation queries the response was YES. [2023-08-30 00:10:14,958 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-08-30 00:10:15,166 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 534 selfloop transitions, 367 changer transitions 12/944 dead transitions. [2023-08-30 00:10:15,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 944 transitions, 21889 flow [2023-08-30 00:10:15,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 00:10:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 00:10:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-08-30 00:10:15,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681647940074906 [2023-08-30 00:10:15,168 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-08-30 00:10:15,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-08-30 00:10:15,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:10:15,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-08-30 00:10:15,170 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-08-30 00:10:15,171 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-08-30 00:10:15,171 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-08-30 00:10:15,172 INFO L175 Difference]: Start difference. First operand has 178 places, 673 transitions, 15036 flow. Second operand 8 states and 1000 transitions. [2023-08-30 00:10:15,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 944 transitions, 21889 flow [2023-08-30 00:10:21,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 944 transitions, 21645 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 00:10:21,422 INFO L231 Difference]: Finished difference. Result has 185 places, 745 transitions, 17457 flow [2023-08-30 00:10:21,422 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-08-30 00:10:21,423 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 130 predicate places. [2023-08-30 00:10:21,423 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 745 transitions, 17457 flow [2023-08-30 00:10:21,423 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-08-30 00:10:21,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:10:21,423 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-08-30 00:10:21,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-30 00:10:21,623 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-08-30 00:10:21,624 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-08-30 00:10:21,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:10:21,624 INFO L85 PathProgramCache]: Analyzing trace with hash -898022775, now seen corresponding path program 3 times [2023-08-30 00:10:21,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:10:21,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287489877] [2023-08-30 00:10:21,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:10:21,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:10:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:10:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:10:21,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:10:21,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287489877] [2023-08-30 00:10:21,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287489877] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:10:21,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519589621] [2023-08-30 00:10:21,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 00:10:21,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:10:21,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:10:21,676 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-08-30 00:10:21,703 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-08-30 00:10:21,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 00:10:21,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:10:21,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:10:21,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:10:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:10:21,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:10:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:10:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519589621] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:10:21,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:10:21,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 00:10:21,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871803068] [2023-08-30 00:10:21,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:10:21,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:10:21,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:10:21,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:10:21,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:10:21,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:10:21,964 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-08-30 00:10:21,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:10:21,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:10:21,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:10:30,316 INFO L130 PetriNetUnfolder]: 34188/44924 cut-off events. [2023-08-30 00:10:30,316 INFO L131 PetriNetUnfolder]: For 1062301/1066242 co-relation queries the response was YES. [2023-08-30 00:10:30,879 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-08-30 00:10:31,079 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 575 selfloop transitions, 364 changer transitions 15/993 dead transitions. [2023-08-30 00:10:31,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 993 transitions, 24105 flow [2023-08-30 00:10:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 00:10:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 00:10:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 992 transitions. [2023-08-30 00:10:31,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46441947565543074 [2023-08-30 00:10:31,081 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 992 transitions. [2023-08-30 00:10:31,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 992 transitions. [2023-08-30 00:10:31,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:10:31,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 992 transitions. [2023-08-30 00:10:31,083 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-08-30 00:10:31,084 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-08-30 00:10:31,085 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-08-30 00:10:31,085 INFO L175 Difference]: Start difference. First operand has 185 places, 745 transitions, 17457 flow. Second operand 8 states and 992 transitions. [2023-08-30 00:10:31,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 993 transitions, 24105 flow [2023-08-30 00:10:39,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 993 transitions, 23071 flow, removed 98 selfloop flow, removed 5 redundant places. [2023-08-30 00:10:39,490 INFO L231 Difference]: Finished difference. Result has 189 places, 818 transitions, 19411 flow [2023-08-30 00:10:39,548 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-08-30 00:10:39,549 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 134 predicate places. [2023-08-30 00:10:39,549 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 818 transitions, 19411 flow [2023-08-30 00:10:39,549 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-08-30 00:10:39,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:10:39,549 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-08-30 00:10:39,555 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-08-30 00:10:39,749 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-08-30 00:10:39,750 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-08-30 00:10:39,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:10:39,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1929965688, now seen corresponding path program 1 times [2023-08-30 00:10:39,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:10:39,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456497946] [2023-08-30 00:10:39,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:10:39,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:10:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:10:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 00:10:39,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:10:39,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456497946] [2023-08-30 00:10:39,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456497946] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:10:39,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961658262] [2023-08-30 00:10:39,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:10:39,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:10:39,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:10:39,804 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-08-30 00:10:39,832 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-08-30 00:10:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:10:39,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 00:10:39,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:10:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 00:10:39,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:10:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 00:10:40,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961658262] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:10:40,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:10:40,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 00:10:40,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535210976] [2023-08-30 00:10:40,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:10:40,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:10:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:10:40,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:10:40,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:10:40,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:10:40,088 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-08-30 00:10:40,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:10:40,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:10:40,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:10:48,469 INFO L130 PetriNetUnfolder]: 33951/44117 cut-off events. [2023-08-30 00:10:48,470 INFO L131 PetriNetUnfolder]: For 1053398/1057366 co-relation queries the response was YES. [2023-08-30 00:10:49,089 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-08-30 00:10:49,566 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 671 selfloop transitions, 383 changer transitions 1/1100 dead transitions. [2023-08-30 00:10:49,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 1100 transitions, 26835 flow [2023-08-30 00:10:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 00:10:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 00:10:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-08-30 00:10:49,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681647940074906 [2023-08-30 00:10:49,568 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-08-30 00:10:49,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-08-30 00:10:49,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:10:49,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-08-30 00:10:49,570 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-08-30 00:10:49,571 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-08-30 00:10:49,571 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-08-30 00:10:49,572 INFO L175 Difference]: Start difference. First operand has 189 places, 818 transitions, 19411 flow. Second operand 8 states and 1000 transitions. [2023-08-30 00:10:49,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 1100 transitions, 26835 flow [2023-08-30 00:10:57,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 1100 transitions, 25833 flow, removed 60 selfloop flow, removed 9 redundant places. [2023-08-30 00:10:57,543 INFO L231 Difference]: Finished difference. Result has 183 places, 835 transitions, 19802 flow [2023-08-30 00:10:57,543 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-08-30 00:10:57,544 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 128 predicate places. [2023-08-30 00:10:57,544 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 835 transitions, 19802 flow [2023-08-30 00:10:57,544 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-08-30 00:10:57,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:10: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, 1, 1, 1] [2023-08-30 00:10:57,550 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-08-30 00:10:57,745 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-08-30 00:10:57,745 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-08-30 00:10:57,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:10:57,746 INFO L85 PathProgramCache]: Analyzing trace with hash -733342054, now seen corresponding path program 1 times [2023-08-30 00:10:57,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:10:57,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449119338] [2023-08-30 00:10:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:10:57,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:10:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:10:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:10:57,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:10:57,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449119338] [2023-08-30 00:10:57,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449119338] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:10:57,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200627873] [2023-08-30 00:10:57,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:10:57,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:10:57,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:10:57,901 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-08-30 00:10:57,904 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-08-30 00:10:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:10:58,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 00:10:58,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:10:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:10:58,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:10:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:10:58,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200627873] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:10:58,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:10:58,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2023-08-30 00:10:58,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978132679] [2023-08-30 00:10:58,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:10:58,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 00:10:58,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:10:58,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 00:10:58,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-30 00:10:58,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 267 [2023-08-30 00:10:58,287 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-08-30 00:10:58,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:10:58,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 267 [2023-08-30 00:10:58,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:11:14,028 INFO L130 PetriNetUnfolder]: 59469/78160 cut-off events. [2023-08-30 00:11:14,028 INFO L131 PetriNetUnfolder]: For 1850806/1868398 co-relation queries the response was YES. [2023-08-30 00:11:15,388 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-08-30 00:11:15,763 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 548 selfloop transitions, 662 changer transitions 5/1281 dead transitions. [2023-08-30 00:11:15,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1281 transitions, 30807 flow [2023-08-30 00:11:15,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 00:11:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 00:11:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1246 transitions. [2023-08-30 00:11:15,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-08-30 00:11:15,765 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1246 transitions. [2023-08-30 00:11:15,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1246 transitions. [2023-08-30 00:11:15,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:11:15,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1246 transitions. [2023-08-30 00:11:15,766 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-08-30 00:11:15,767 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-08-30 00:11:15,768 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-08-30 00:11:15,768 INFO L175 Difference]: Start difference. First operand has 183 places, 835 transitions, 19802 flow. Second operand 9 states and 1246 transitions. [2023-08-30 00:11:15,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 1281 transitions, 30807 flow [2023-08-30 00:11:36,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1281 transitions, 29157 flow, removed 117 selfloop flow, removed 12 redundant places. [2023-08-30 00:11:36,402 INFO L231 Difference]: Finished difference. Result has 182 places, 1171 transitions, 29350 flow [2023-08-30 00:11:36,402 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-08-30 00:11:36,403 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 127 predicate places. [2023-08-30 00:11:36,403 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 1171 transitions, 29350 flow [2023-08-30 00:11:36,403 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-08-30 00:11:36,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:11:36,403 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-08-30 00:11:36,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-08-30 00:11:36,608 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-08-30 00:11:36,608 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-08-30 00:11:36,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:11:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash -672429962, now seen corresponding path program 2 times [2023-08-30 00:11:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 00:11:36,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346024774] [2023-08-30 00:11:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:11:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 00:11:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:11:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 00:11:36,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 00:11:36,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346024774] [2023-08-30 00:11:36,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346024774] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 00:11:36,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231974144] [2023-08-30 00:11:36,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 00:11:36,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 00:11:36,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:11:36,676 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-08-30 00:11:36,678 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-08-30 00:11:36,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 00:11:36,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:11:36,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 00:11:36,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:11:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 00:11:36,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:11:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 00:11:36,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231974144] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:11:36,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 00:11:36,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-08-30 00:11:36,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782935523] [2023-08-30 00:11:36,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 00:11:36,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 00:11:36,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 00:11:36,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 00:11:36,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-08-30 00:11:36,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 00:11:36,976 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-08-30 00:11:36,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:11:36,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 00:11:36,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:12:07,173 INFO L130 PetriNetUnfolder]: 99106/132036 cut-off events. [2023-08-30 00:12:07,174 INFO L131 PetriNetUnfolder]: For 2985121/3007036 co-relation queries the response was YES. [2023-08-30 00:12:08,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086054 conditions, 132036 events. 99106/132036 cut-off events. For 2985121/3007036 co-relation queries the response was YES. Maximal size of possible extension queue 5127. Compared 845318 event pairs, 3493 based on Foata normal form. 11900/143192 useless extension candidates. Maximal degree in co-relation 1085980. Up to 72705 conditions per place. [2023-08-30 00:12:09,773 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 2900 selfloop transitions, 1106 changer transitions 0/4039 dead transitions. [2023-08-30 00:12:09,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 4039 transitions, 102538 flow [2023-08-30 00:12:09,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 00:12:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 00:12:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2527 transitions. [2023-08-30 00:12:09,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47322097378277156 [2023-08-30 00:12:09,807 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2527 transitions. [2023-08-30 00:12:09,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2527 transitions. [2023-08-30 00:12:09,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:12:09,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2527 transitions. [2023-08-30 00:12:09,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 126.35) internal successors, (2527), 20 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:12:09,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:12:09,814 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:12:09,814 INFO L175 Difference]: Start difference. First operand has 182 places, 1171 transitions, 29350 flow. Second operand 20 states and 2527 transitions. [2023-08-30 00:12:09,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 4039 transitions, 102538 flow Killed by 15