./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 16:51:41,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 16:51:41,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 16:51:41,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 16:51:41,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 16:51:41,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 16:51:41,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 16:51:41,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 16:51:41,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 16:51:41,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 16:51:41,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 16:51:41,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 16:51:41,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 16:51:41,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 16:51:41,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 16:51:41,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 16:51:41,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 16:51:41,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 16:51:41,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 16:51:41,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 16:51:41,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 16:51:41,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 16:51:41,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 16:51:41,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 16:51:41,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 16:51:41,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 16:51:41,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 16:51:41,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 16:51:41,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 16:51:41,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 16:51:41,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 16:51:41,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 16:51:41,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 16:51:41,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 16:51:41,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 16:51:41,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 16:51:41,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 16:51:41,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 16:51:41,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 16:51:41,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 16:51:41,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 16:51:41,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 16:51:41,457 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 16:51:41,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 16:51:41,458 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 16:51:41,458 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 16:51:41,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 16:51:41,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 16:51:41,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 16:51:41,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 16:51:41,460 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 16:51:41,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 16:51:41,461 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 16:51:41,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 16:51:41,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 16:51:41,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 16:51:41,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 16:51:41,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 16:51:41,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 16:51:41,462 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 16:51:41,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 16:51:41,463 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 16:51:41,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 16:51:41,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 16:51:41,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 16:51:41,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 16:51:41,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:51:41,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 16:51:41,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 16:51:41,465 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 16:51:41,466 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 16:51:41,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 16:51:41,466 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 16:51:41,466 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 16:51:41,467 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 16:51:41,467 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 16:51:41,467 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 ! call(reach_error())) ) 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 [2021-12-14 16:51:41,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 16:51:41,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 16:51:41,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 16:51:41,734 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 16:51:41,734 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 16:51:41,735 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2021-12-14 16:51:41,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9ba193c/e1916a3b6a0a4005b685ace111d09dd6/FLAG9777dbf33 [2021-12-14 16:51:42,168 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 16:51:42,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2021-12-14 16:51:42,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9ba193c/e1916a3b6a0a4005b685ace111d09dd6/FLAG9777dbf33 [2021-12-14 16:51:42,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9ba193c/e1916a3b6a0a4005b685ace111d09dd6 [2021-12-14 16:51:42,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 16:51:42,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 16:51:42,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 16:51:42,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 16:51:42,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 16:51:42,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:51:42" (1/1) ... [2021-12-14 16:51:42,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb64328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42, skipping insertion in model container [2021-12-14 16:51:42,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:51:42" (1/1) ... [2021-12-14 16:51:42,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 16:51:42,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 16:51:42,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2021-12-14 16:51:42,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:51:42,422 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 16:51:42,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2021-12-14 16:51:42,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:51:42,474 INFO L208 MainTranslator]: Completed translation [2021-12-14 16:51:42,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42 WrapperNode [2021-12-14 16:51:42,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 16:51:42,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 16:51:42,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 16:51:42,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 16:51:42,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42" (1/1) ... [2021-12-14 16:51:42,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42" (1/1) ... [2021-12-14 16:51:42,528 INFO L137 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2021-12-14 16:51:42,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 16:51:42,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 16:51:42,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 16:51:42,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 16:51:42,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42" (1/1) ... [2021-12-14 16:51:42,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42" (1/1) ... [2021-12-14 16:51:42,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42" (1/1) ... [2021-12-14 16:51:42,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42" (1/1) ... [2021-12-14 16:51:42,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42" (1/1) ... [2021-12-14 16:51:42,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42" (1/1) ... [2021-12-14 16:51:42,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42" (1/1) ... [2021-12-14 16:51:42,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 16:51:42,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 16:51:42,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 16:51:42,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 16:51:42,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42" (1/1) ... [2021-12-14 16:51:42,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:51:42,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:51:42,597 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) [2021-12-14 16:51:42,601 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 [2021-12-14 16:51:42,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 16:51:42,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-14 16:51:42,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-14 16:51:42,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-14 16:51:42,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-14 16:51:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-14 16:51:42,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-14 16:51:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-12-14 16:51:42,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-12-14 16:51:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 16:51:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 16:51:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 16:51:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-14 16:51:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-14 16:51:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 16:51:42,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 16:51:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 16:51:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 16:51:42,628 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-14 16:51:42,691 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 16:51:42,693 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 16:51:42,882 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 16:51:42,942 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 16:51:42,944 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-14 16:51:42,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:51:42 BoogieIcfgContainer [2021-12-14 16:51:42,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 16:51:42,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 16:51:42,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 16:51:42,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 16:51:42,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:51:42" (1/3) ... [2021-12-14 16:51:42,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e245c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:51:42, skipping insertion in model container [2021-12-14 16:51:42,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:51:42" (2/3) ... [2021-12-14 16:51:42,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e245c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:51:42, skipping insertion in model container [2021-12-14 16:51:42,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:51:42" (3/3) ... [2021-12-14 16:51:42,959 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2021-12-14 16:51:42,963 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-14 16:51:42,964 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 16:51:42,964 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 16:51:42,964 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-14 16:51:42,995 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,996 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,996 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,996 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,996 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,997 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,998 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,998 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,999 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:42,999 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,000 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,002 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,002 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,002 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,002 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,002 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,003 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,003 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,003 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,003 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,003 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,004 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,004 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,004 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,004 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,004 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,004 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,006 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,006 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,006 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,006 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,006 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,007 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,007 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,008 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,008 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,008 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,008 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,008 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,009 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,009 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,009 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,009 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,009 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,010 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,010 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,010 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,010 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,011 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,011 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,011 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,011 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,011 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,012 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,012 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,012 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,012 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,012 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,013 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,013 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,013 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,013 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,013 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,014 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,014 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,014 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,014 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,014 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,015 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,015 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,015 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,015 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,018 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,019 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,020 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,020 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,020 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,020 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,021 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,021 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,021 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,021 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,021 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,022 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,022 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:51:43,027 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-12-14 16:51:43,086 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 16:51:43,095 INFO L339 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 16:51:43,095 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-14 16:51:43,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 124 transitions, 280 flow [2021-12-14 16:51:43,201 INFO L129 PetriNetUnfolder]: 9/120 cut-off events. [2021-12-14 16:51:43,201 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-14 16:51:43,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 120 events. 9/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 97 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2021-12-14 16:51:43,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 124 transitions, 280 flow [2021-12-14 16:51:43,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 107 transitions, 238 flow [2021-12-14 16:51:43,235 INFO L129 PetriNetUnfolder]: 9/106 cut-off events. [2021-12-14 16:51:43,235 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-14 16:51:43,236 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:51:43,237 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:51:43,237 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:51:43,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:51:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash -835718213, now seen corresponding path program 1 times [2021-12-14 16:51:43,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:51:43,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468119907] [2021-12-14 16:51:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:51:43,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:51:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:51:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:51:43,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:51:43,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468119907] [2021-12-14 16:51:43,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468119907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:51:43,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:51:43,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:51:43,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507772353] [2021-12-14 16:51:43,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:51:43,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:51:43,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:51:43,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:51:43,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:51:43,666 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 124 [2021-12-14 16:51:43,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 107 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:43,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:51:43,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 124 [2021-12-14 16:51:43,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:51:43,854 INFO L129 PetriNetUnfolder]: 107/494 cut-off events. [2021-12-14 16:51:43,854 INFO L130 PetriNetUnfolder]: For 115/116 co-relation queries the response was YES. [2021-12-14 16:51:43,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 494 events. 107/494 cut-off events. For 115/116 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2247 event pairs, 24 based on Foata normal form. 136/564 useless extension candidates. Maximal degree in co-relation 525. Up to 124 conditions per place. [2021-12-14 16:51:43,863 INFO L132 encePairwiseOnDemand]: 109/124 looper letters, 32 selfloop transitions, 5 changer transitions 8/128 dead transitions. [2021-12-14 16:51:43,863 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 128 transitions, 406 flow [2021-12-14 16:51:43,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 16:51:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-14 16:51:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 856 transitions. [2021-12-14 16:51:43,884 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8629032258064516 [2021-12-14 16:51:43,885 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 856 transitions. [2021-12-14 16:51:43,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 856 transitions. [2021-12-14 16:51:43,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:51:43,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 856 transitions. [2021-12-14 16:51:43,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:43,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:43,903 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:43,905 INFO L186 Difference]: Start difference. First operand has 111 places, 107 transitions, 238 flow. Second operand 8 states and 856 transitions. [2021-12-14 16:51:43,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 128 transitions, 406 flow [2021-12-14 16:51:43,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 128 transitions, 366 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-12-14 16:51:43,917 INFO L242 Difference]: Finished difference. Result has 114 places, 104 transitions, 249 flow [2021-12-14 16:51:43,919 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=249, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2021-12-14 16:51:43,923 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 3 predicate places. [2021-12-14 16:51:43,923 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 249 flow [2021-12-14 16:51:43,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:43,924 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:51:43,925 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:51:43,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 16:51:43,925 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:51:43,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:51:43,926 INFO L85 PathProgramCache]: Analyzing trace with hash 365170717, now seen corresponding path program 1 times [2021-12-14 16:51:43,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:51:43,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479672318] [2021-12-14 16:51:43,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:51:43,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:51:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:51:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:51:44,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:51:44,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479672318] [2021-12-14 16:51:44,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479672318] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:51:44,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:51:44,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 16:51:44,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414171473] [2021-12-14 16:51:44,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:51:44,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:51:44,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:51:44,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:51:44,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 16:51:44,054 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-14 16:51:44,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:44,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:51:44,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-14 16:51:44,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:51:45,366 INFO L129 PetriNetUnfolder]: 6233/11726 cut-off events. [2021-12-14 16:51:45,367 INFO L130 PetriNetUnfolder]: For 1563/1563 co-relation queries the response was YES. [2021-12-14 16:51:45,401 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22312 conditions, 11726 events. 6233/11726 cut-off events. For 1563/1563 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 96468 event pairs, 2937 based on Foata normal form. 0/9031 useless extension candidates. Maximal degree in co-relation 22289. Up to 3632 conditions per place. [2021-12-14 16:51:45,470 INFO L132 encePairwiseOnDemand]: 117/124 looper letters, 83 selfloop transitions, 6 changer transitions 0/162 dead transitions. [2021-12-14 16:51:45,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 162 transitions, 602 flow [2021-12-14 16:51:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:51:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-14 16:51:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2021-12-14 16:51:45,473 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-12-14 16:51:45,473 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 620 transitions. [2021-12-14 16:51:45,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 620 transitions. [2021-12-14 16:51:45,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:51:45,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 620 transitions. [2021-12-14 16:51:45,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:45,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:45,478 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:45,478 INFO L186 Difference]: Start difference. First operand has 114 places, 104 transitions, 249 flow. Second operand 6 states and 620 transitions. [2021-12-14 16:51:45,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 162 transitions, 602 flow [2021-12-14 16:51:45,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 162 transitions, 598 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-12-14 16:51:45,484 INFO L242 Difference]: Finished difference. Result has 115 places, 107 transitions, 277 flow [2021-12-14 16:51:45,485 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=115, PETRI_TRANSITIONS=107} [2021-12-14 16:51:45,485 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 4 predicate places. [2021-12-14 16:51:45,486 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 107 transitions, 277 flow [2021-12-14 16:51:45,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:45,486 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:51:45,487 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:51:45,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 16:51:45,487 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:51:45,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:51:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1177269511, now seen corresponding path program 2 times [2021-12-14 16:51:45,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:51:45,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114312908] [2021-12-14 16:51:45,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:51:45,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:51:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:51:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:51:45,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:51:45,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114312908] [2021-12-14 16:51:45,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114312908] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:51:45,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941062048] [2021-12-14 16:51:45,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 16:51:45,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:51:45,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:51:45,627 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) [2021-12-14 16:51:45,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 16:51:45,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 16:51:45,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 16:51:45,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 16:51:45,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:51:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:51:45,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 16:51:46,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:51:46,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941062048] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 16:51:46,110 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 16:51:46,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-14 16:51:46,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572135187] [2021-12-14 16:51:46,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 16:51:46,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:51:46,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:51:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:51:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:51:46,119 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-14 16:51:46,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 277 flow. Second operand has 9 states, 9 states have (on average 93.11111111111111) internal successors, (838), 9 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:46,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:51:46,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-14 16:51:46,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:51:47,741 INFO L129 PetriNetUnfolder]: 10141/15803 cut-off events. [2021-12-14 16:51:47,741 INFO L130 PetriNetUnfolder]: For 5123/5155 co-relation queries the response was YES. [2021-12-14 16:51:47,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35365 conditions, 15803 events. 10141/15803 cut-off events. For 5123/5155 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 113133 event pairs, 1088 based on Foata normal form. 192/13136 useless extension candidates. Maximal degree in co-relation 29374. Up to 2334 conditions per place. [2021-12-14 16:51:47,874 INFO L132 encePairwiseOnDemand]: 116/124 looper letters, 177 selfloop transitions, 28 changer transitions 1/279 dead transitions. [2021-12-14 16:51:47,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 279 transitions, 1237 flow [2021-12-14 16:51:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:51:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-14 16:51:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1452 transitions. [2021-12-14 16:51:47,878 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.836405529953917 [2021-12-14 16:51:47,878 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1452 transitions. [2021-12-14 16:51:47,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1452 transitions. [2021-12-14 16:51:47,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:51:47,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1452 transitions. [2021-12-14 16:51:47,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 103.71428571428571) internal successors, (1452), 14 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:47,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 124.0) internal successors, (1860), 15 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:47,888 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 124.0) internal successors, (1860), 15 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:47,888 INFO L186 Difference]: Start difference. First operand has 115 places, 107 transitions, 277 flow. Second operand 14 states and 1452 transitions. [2021-12-14 16:51:47,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 279 transitions, 1237 flow [2021-12-14 16:51:47,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 279 transitions, 1222 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-14 16:51:47,908 INFO L242 Difference]: Finished difference. Result has 133 places, 135 transitions, 470 flow [2021-12-14 16:51:47,909 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=470, PETRI_PLACES=133, PETRI_TRANSITIONS=135} [2021-12-14 16:51:47,911 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 22 predicate places. [2021-12-14 16:51:47,911 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 135 transitions, 470 flow [2021-12-14 16:51:47,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.11111111111111) internal successors, (838), 9 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:47,912 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:51:47,912 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:51:47,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 16:51:48,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:51:48,128 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:51:48,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:51:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash -290999237, now seen corresponding path program 3 times [2021-12-14 16:51:48,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:51:48,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004938091] [2021-12-14 16:51:48,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:51:48,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:51:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:51:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:51:48,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:51:48,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004938091] [2021-12-14 16:51:48,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004938091] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:51:48,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:51:48,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 16:51:48,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471743626] [2021-12-14 16:51:48,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:51:48,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:51:48,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:51:48,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:51:48,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 16:51:48,244 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-14 16:51:48,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 135 transitions, 470 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:48,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:51:48,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-14 16:51:48,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:51:50,567 INFO L129 PetriNetUnfolder]: 13768/22840 cut-off events. [2021-12-14 16:51:50,567 INFO L130 PetriNetUnfolder]: For 26912/28031 co-relation queries the response was YES. [2021-12-14 16:51:50,680 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58648 conditions, 22840 events. 13768/22840 cut-off events. For 26912/28031 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 188633 event pairs, 4285 based on Foata normal form. 1060/20635 useless extension candidates. Maximal degree in co-relation 43866. Up to 9840 conditions per place. [2021-12-14 16:51:50,821 INFO L132 encePairwiseOnDemand]: 116/124 looper letters, 115 selfloop transitions, 21 changer transitions 1/222 dead transitions. [2021-12-14 16:51:50,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 222 transitions, 1098 flow [2021-12-14 16:51:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:51:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-14 16:51:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2021-12-14 16:51:50,824 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8629032258064516 [2021-12-14 16:51:50,824 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2021-12-14 16:51:50,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2021-12-14 16:51:50,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:51:50,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2021-12-14 16:51:50,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 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) [2021-12-14 16:51:50,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:50,828 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:50,828 INFO L186 Difference]: Start difference. First operand has 133 places, 135 transitions, 470 flow. Second operand 6 states and 642 transitions. [2021-12-14 16:51:50,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 222 transitions, 1098 flow [2021-12-14 16:51:50,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 222 transitions, 1092 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-12-14 16:51:50,943 INFO L242 Difference]: Finished difference. Result has 140 places, 149 transitions, 594 flow [2021-12-14 16:51:50,943 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=594, PETRI_PLACES=140, PETRI_TRANSITIONS=149} [2021-12-14 16:51:50,944 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 29 predicate places. [2021-12-14 16:51:50,945 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 149 transitions, 594 flow [2021-12-14 16:51:50,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:50,945 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:51:50,945 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:51:50,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 16:51:50,946 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:51:50,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:51:50,946 INFO L85 PathProgramCache]: Analyzing trace with hash -551484583, now seen corresponding path program 1 times [2021-12-14 16:51:50,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:51:50,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122174665] [2021-12-14 16:51:50,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:51:50,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:51:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:51:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:51:51,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:51:51,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122174665] [2021-12-14 16:51:51,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122174665] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:51:51,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:51:51,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 16:51:51,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127085107] [2021-12-14 16:51:51,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:51:51,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:51:51,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:51:51,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:51:51,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 16:51:51,052 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-14 16:51:51,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 149 transitions, 594 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:51,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:51:51,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-14 16:51:51,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:51:53,546 INFO L129 PetriNetUnfolder]: 16121/28229 cut-off events. [2021-12-14 16:51:53,546 INFO L130 PetriNetUnfolder]: For 39584/41423 co-relation queries the response was YES. [2021-12-14 16:51:53,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77396 conditions, 28229 events. 16121/28229 cut-off events. For 39584/41423 co-relation queries the response was YES. Maximal size of possible extension queue 1663. Compared 256255 event pairs, 7338 based on Foata normal form. 1500/28138 useless extension candidates. Maximal degree in co-relation 58149. Up to 11933 conditions per place. [2021-12-14 16:51:53,924 INFO L132 encePairwiseOnDemand]: 117/124 looper letters, 74 selfloop transitions, 19 changer transitions 13/195 dead transitions. [2021-12-14 16:51:53,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 195 transitions, 985 flow [2021-12-14 16:51:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:51:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-14 16:51:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 617 transitions. [2021-12-14 16:51:53,927 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8293010752688172 [2021-12-14 16:51:53,927 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 617 transitions. [2021-12-14 16:51:53,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 617 transitions. [2021-12-14 16:51:53,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:51:53,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 617 transitions. [2021-12-14 16:51:53,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:53,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:53,931 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:53,931 INFO L186 Difference]: Start difference. First operand has 140 places, 149 transitions, 594 flow. Second operand 6 states and 617 transitions. [2021-12-14 16:51:53,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 195 transitions, 985 flow [2021-12-14 16:51:54,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 195 transitions, 983 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-12-14 16:51:54,173 INFO L242 Difference]: Finished difference. Result has 147 places, 149 transitions, 639 flow [2021-12-14 16:51:54,173 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=147, PETRI_TRANSITIONS=149} [2021-12-14 16:51:54,174 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 36 predicate places. [2021-12-14 16:51:54,174 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 149 transitions, 639 flow [2021-12-14 16:51:54,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:54,175 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:51:54,175 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:51:54,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 16:51:54,176 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:51:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:51:54,176 INFO L85 PathProgramCache]: Analyzing trace with hash -453112731, now seen corresponding path program 4 times [2021-12-14 16:51:54,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:51:54,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626854304] [2021-12-14 16:51:54,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:51:54,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:51:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:51:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:51:54,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:51:54,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626854304] [2021-12-14 16:51:54,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626854304] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:51:54,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836780851] [2021-12-14 16:51:54,257 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 16:51:54,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:51:54,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:51:54,260 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) [2021-12-14 16:51:54,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 16:51:54,344 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 16:51:54,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 16:51:54,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 16:51:54,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:51:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:51:54,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 16:51:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:51:54,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836780851] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 16:51:54,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 16:51:54,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-12-14 16:51:54,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326948848] [2021-12-14 16:51:54,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 16:51:54,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 16:51:54,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:51:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 16:51:54,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:51:54,661 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-14 16:51:54,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 149 transitions, 639 flow. Second operand has 11 states, 11 states have (on average 93.36363636363636) internal successors, (1027), 11 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:54,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:51:54,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-14 16:51:54,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:51:57,288 INFO L129 PetriNetUnfolder]: 18450/33118 cut-off events. [2021-12-14 16:51:57,288 INFO L130 PetriNetUnfolder]: For 49627/50222 co-relation queries the response was YES. [2021-12-14 16:51:57,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90983 conditions, 33118 events. 18450/33118 cut-off events. For 49627/50222 co-relation queries the response was YES. Maximal size of possible extension queue 1889. Compared 309695 event pairs, 4958 based on Foata normal form. 668/32188 useless extension candidates. Maximal degree in co-relation 69617. Up to 7001 conditions per place. [2021-12-14 16:51:57,814 INFO L132 encePairwiseOnDemand]: 116/124 looper letters, 176 selfloop transitions, 46 changer transitions 0/299 dead transitions. [2021-12-14 16:51:57,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 299 transitions, 1847 flow [2021-12-14 16:51:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:51:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:51:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 956 transitions. [2021-12-14 16:51:57,817 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8566308243727598 [2021-12-14 16:51:57,817 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 956 transitions. [2021-12-14 16:51:57,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 956 transitions. [2021-12-14 16:51:57,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:51:57,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 956 transitions. [2021-12-14 16:51:57,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:57,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:57,824 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:57,824 INFO L186 Difference]: Start difference. First operand has 147 places, 149 transitions, 639 flow. Second operand 9 states and 956 transitions. [2021-12-14 16:51:57,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 299 transitions, 1847 flow [2021-12-14 16:51:58,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 299 transitions, 1799 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-12-14 16:51:58,030 INFO L242 Difference]: Finished difference. Result has 156 places, 171 transitions, 954 flow [2021-12-14 16:51:58,030 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=954, PETRI_PLACES=156, PETRI_TRANSITIONS=171} [2021-12-14 16:51:58,031 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 45 predicate places. [2021-12-14 16:51:58,031 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 171 transitions, 954 flow [2021-12-14 16:51:58,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 93.36363636363636) internal successors, (1027), 11 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:58,032 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:51:58,032 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:51:58,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-14 16:51:58,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-14 16:51:58,255 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:51:58,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:51:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash -584767227, now seen corresponding path program 2 times [2021-12-14 16:51:58,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:51:58,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775618062] [2021-12-14 16:51:58,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:51:58,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:51:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:51:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:51:58,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:51:58,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775618062] [2021-12-14 16:51:58,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775618062] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:51:58,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:51:58,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 16:51:58,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369232937] [2021-12-14 16:51:58,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:51:58,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:51:58,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:51:58,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:51:58,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-14 16:51:58,318 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-14 16:51:58,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 171 transitions, 954 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:51:58,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:51:58,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-14 16:51:58,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:52:03,751 INFO L129 PetriNetUnfolder]: 36954/61959 cut-off events. [2021-12-14 16:52:03,751 INFO L130 PetriNetUnfolder]: For 183796/188821 co-relation queries the response was YES. [2021-12-14 16:52:04,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 192980 conditions, 61959 events. 36954/61959 cut-off events. For 183796/188821 co-relation queries the response was YES. Maximal size of possible extension queue 3160. Compared 589323 event pairs, 14655 based on Foata normal form. 4613/63292 useless extension candidates. Maximal degree in co-relation 142433. Up to 25194 conditions per place. [2021-12-14 16:52:04,405 INFO L132 encePairwiseOnDemand]: 118/124 looper letters, 224 selfloop transitions, 23 changer transitions 4/344 dead transitions. [2021-12-14 16:52:04,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 344 transitions, 2927 flow [2021-12-14 16:52:04,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 16:52:04,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-14 16:52:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2021-12-14 16:52:04,408 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8548387096774194 [2021-12-14 16:52:04,408 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2021-12-14 16:52:04,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2021-12-14 16:52:04,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:52:04,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2021-12-14 16:52:04,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:04,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:04,411 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:04,412 INFO L186 Difference]: Start difference. First operand has 156 places, 171 transitions, 954 flow. Second operand 5 states and 530 transitions. [2021-12-14 16:52:04,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 344 transitions, 2927 flow [2021-12-14 16:52:04,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 344 transitions, 2911 flow, removed 8 selfloop flow, removed 0 redundant places. [2021-12-14 16:52:04,959 INFO L242 Difference]: Finished difference. Result has 163 places, 192 transitions, 1297 flow [2021-12-14 16:52:04,959 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1297, PETRI_PLACES=163, PETRI_TRANSITIONS=192} [2021-12-14 16:52:04,960 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 52 predicate places. [2021-12-14 16:52:04,960 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 192 transitions, 1297 flow [2021-12-14 16:52:04,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:04,961 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:52:04,961 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:52:04,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 16:52:04,961 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:52:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:52:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1402727025, now seen corresponding path program 3 times [2021-12-14 16:52:04,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:52:04,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799294820] [2021-12-14 16:52:04,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:52:04,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:52:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:52:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:52:04,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:52:04,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799294820] [2021-12-14 16:52:04,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799294820] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:52:04,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:52:05,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 16:52:05,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617624961] [2021-12-14 16:52:05,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:52:05,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:52:05,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:52:05,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:52:05,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 16:52:05,002 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-14 16:52:05,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 192 transitions, 1297 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:05,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:52:05,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-14 16:52:05,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:52:10,910 INFO L129 PetriNetUnfolder]: 34646/62394 cut-off events. [2021-12-14 16:52:10,911 INFO L130 PetriNetUnfolder]: For 158440/160141 co-relation queries the response was YES. [2021-12-14 16:52:11,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 197837 conditions, 62394 events. 34646/62394 cut-off events. For 158440/160141 co-relation queries the response was YES. Maximal size of possible extension queue 3110. Compared 649967 event pairs, 11610 based on Foata normal form. 1033/62297 useless extension candidates. Maximal degree in co-relation 175462. Up to 24446 conditions per place. [2021-12-14 16:52:11,874 INFO L132 encePairwiseOnDemand]: 117/124 looper letters, 136 selfloop transitions, 18 changer transitions 3/271 dead transitions. [2021-12-14 16:52:11,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 271 transitions, 2059 flow [2021-12-14 16:52:11,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:52:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-14 16:52:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2021-12-14 16:52:11,880 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.831989247311828 [2021-12-14 16:52:11,880 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 619 transitions. [2021-12-14 16:52:11,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 619 transitions. [2021-12-14 16:52:11,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:52:11,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 619 transitions. [2021-12-14 16:52:11,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:11,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:11,884 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:11,884 INFO L186 Difference]: Start difference. First operand has 163 places, 192 transitions, 1297 flow. Second operand 6 states and 619 transitions. [2021-12-14 16:52:11,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 271 transitions, 2059 flow [2021-12-14 16:52:13,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 271 transitions, 2059 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-14 16:52:13,405 INFO L242 Difference]: Finished difference. Result has 170 places, 193 transitions, 1347 flow [2021-12-14 16:52:13,405 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1347, PETRI_PLACES=170, PETRI_TRANSITIONS=193} [2021-12-14 16:52:13,405 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 59 predicate places. [2021-12-14 16:52:13,406 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 193 transitions, 1347 flow [2021-12-14 16:52:13,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:13,406 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:52:13,406 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:52:13,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 16:52:13,407 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:52:13,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:52:13,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1376975019, now seen corresponding path program 4 times [2021-12-14 16:52:13,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:52:13,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342634432] [2021-12-14 16:52:13,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:52:13,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:52:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:52:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:52:13,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:52:13,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342634432] [2021-12-14 16:52:13,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342634432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:52:13,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:52:13,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 16:52:13,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688679841] [2021-12-14 16:52:13,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:52:13,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:52:13,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:52:13,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:52:13,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 16:52:13,452 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-14 16:52:13,453 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 193 transitions, 1347 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:13,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:52:13,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-14 16:52:13,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:52:15,246 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][211], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 33#L73true, 32#L52true, 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 40#L41-3true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 25#L65true, Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 705#true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2021-12-14 16:52:15,246 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2021-12-14 16:52:15,247 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-14 16:52:15,247 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-14 16:52:15,247 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-14 16:52:15,530 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 33#L73true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 25#L65true, Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:15,530 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-12-14 16:52:15,530 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:15,530 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:15,530 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:15,533 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][211], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 33#L73true, 32#L52true, 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 83#L62-2true, Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 40#L41-3true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 705#true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2021-12-14 16:52:15,533 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-12-14 16:52:15,533 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:15,533 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:15,533 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:15,534 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][211], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 32#L52true, 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 116#L76true, 40#L41-3true, 25#L65true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 705#true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2021-12-14 16:52:15,534 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-12-14 16:52:15,534 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:15,534 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:15,534 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:16,205 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 33#L73true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 83#L62-2true, Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:16,205 INFO L384 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,205 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,205 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,205 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,205 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 116#L76true, 25#L65true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:16,206 INFO L384 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,206 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,206 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,206 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,208 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][211], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 32#L52true, 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 83#L62-2true, Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 40#L41-3true, 116#L76true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 705#true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2021-12-14 16:52:16,208 INFO L384 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,209 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,209 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,209 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,209 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][211], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 32#L52true, 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 40#L41-3true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 25#L65true, 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 705#true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2021-12-14 16:52:16,209 INFO L384 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,209 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,209 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,209 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:16,589 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 83#L62-2true, Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 116#L76true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 705#true, 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:16,589 INFO L384 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2021-12-14 16:52:16,589 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-14 16:52:16,589 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-14 16:52:16,589 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-14 16:52:16,590 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 25#L65true, 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:16,590 INFO L384 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2021-12-14 16:52:16,590 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-14 16:52:16,590 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-14 16:52:16,590 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-14 16:52:16,593 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][211], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 32#L52true, 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 83#L62-2true, Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 40#L41-3true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 705#true, 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2021-12-14 16:52:16,593 INFO L384 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2021-12-14 16:52:16,593 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-14 16:52:16,593 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-14 16:52:16,593 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-14 16:52:16,678 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 131#true, Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1260#true, Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 82#thread3ENTRYtrue, Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 116#L76true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:16,678 INFO L384 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2021-12-14 16:52:16,678 INFO L387 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2021-12-14 16:52:16,678 INFO L387 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2021-12-14 16:52:16,678 INFO L387 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2021-12-14 16:52:17,007 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 83#L62-2true, Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:17,007 INFO L384 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2021-12-14 16:52:17,007 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-14 16:52:17,008 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-14 16:52:17,008 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-14 16:52:17,095 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 111#L51-4true, Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 56#L62-4true, 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 116#L76true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:17,095 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-14 16:52:17,095 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-14 16:52:17,095 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-14 16:52:17,095 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-14 16:52:17,095 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 131#true, Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1260#true, Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 82#thread3ENTRYtrue, Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:17,096 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-14 16:52:17,096 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-14 16:52:17,096 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-14 16:52:17,096 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-14 16:52:17,734 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 111#L51-4true, Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 116#L76true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 11#L62-5true, Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:17,734 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-14 16:52:17,734 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:17,734 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:17,734 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:17,734 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 111#L51-4true, Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 131#true, Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 52#L63true, 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 116#L76true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:17,734 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-14 16:52:17,734 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:17,734 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:17,735 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:17,735 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 111#L51-4true, Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 56#L62-4true, 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:17,736 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-14 16:52:17,736 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:17,736 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:17,736 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-14 16:52:18,073 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 111#L51-4true, Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 705#true, 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 12#L41-5true, 11#L62-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:18,073 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-14 16:52:18,073 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:18,074 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:18,074 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:18,074 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 111#L51-4true, Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 52#L63true, 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 705#true, 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-14 16:52:18,074 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-14 16:52:18,074 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:18,074 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:18,074 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-14 16:52:21,873 INFO L129 PetriNetUnfolder]: 49827/85142 cut-off events. [2021-12-14 16:52:21,873 INFO L130 PetriNetUnfolder]: For 326628/335574 co-relation queries the response was YES. [2021-12-14 16:52:22,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 283664 conditions, 85142 events. 49827/85142 cut-off events. For 326628/335574 co-relation queries the response was YES. Maximal size of possible extension queue 4121. Compared 851886 event pairs, 20637 based on Foata normal form. 5633/88499 useless extension candidates. Maximal degree in co-relation 245112. Up to 33868 conditions per place. [2021-12-14 16:52:23,228 INFO L132 encePairwiseOnDemand]: 117/124 looper letters, 187 selfloop transitions, 12 changer transitions 6/331 dead transitions. [2021-12-14 16:52:23,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 331 transitions, 2757 flow [2021-12-14 16:52:23,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:52:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-14 16:52:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2021-12-14 16:52:23,230 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8279569892473119 [2021-12-14 16:52:23,230 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 616 transitions. [2021-12-14 16:52:23,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions. [2021-12-14 16:52:23,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:52:23,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions. [2021-12-14 16:52:23,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:23,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:23,234 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:23,234 INFO L186 Difference]: Start difference. First operand has 170 places, 193 transitions, 1347 flow. Second operand 6 states and 616 transitions. [2021-12-14 16:52:23,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 331 transitions, 2757 flow [2021-12-14 16:52:24,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 331 transitions, 2721 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-14 16:52:24,320 INFO L242 Difference]: Finished difference. Result has 175 places, 196 transitions, 1377 flow [2021-12-14 16:52:24,320 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1377, PETRI_PLACES=175, PETRI_TRANSITIONS=196} [2021-12-14 16:52:24,320 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 64 predicate places. [2021-12-14 16:52:24,321 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 196 transitions, 1377 flow [2021-12-14 16:52:24,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:24,321 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:52:24,321 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:52:24,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 16:52:24,322 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:52:24,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:52:24,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1176667927, now seen corresponding path program 5 times [2021-12-14 16:52:24,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:52:24,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30125463] [2021-12-14 16:52:24,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:52:24,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:52:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:52:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:52:24,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:52:24,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30125463] [2021-12-14 16:52:24,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30125463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:52:24,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:52:24,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:52:24,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903215150] [2021-12-14 16:52:24,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:52:24,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:52:24,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:52:24,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:52:24,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:52:24,372 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-14 16:52:24,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 196 transitions, 1377 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:24,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:52:24,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-14 16:52:24,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand