./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc --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 846c6ea342419c7ea85c72de8af40f1cf8af72c22131b8a3f2ebdacec113c699 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:27:53,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:27:53,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:27:54,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:27:54,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:27:54,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:27:54,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:27:54,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:27:54,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:27:54,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:27:54,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:27:54,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:27:54,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:27:54,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:27:54,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:27:54,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:27:54,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:27:54,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:27:54,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:27:54,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:27:54,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:27:54,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:27:54,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:27:54,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:27:54,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:27:54,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:27:54,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:27:54,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:27:54,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:27:54,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:27:54,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:27:54,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:27:54,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:27:54,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:27:54,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:27:54,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:27:54,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:27:54,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:27:54,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:27:54,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:27:54,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:27:54,121 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:27:54,166 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:27:54,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:27:54,167 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:27:54,167 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:27:54,169 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:27:54,169 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:27:54,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:27:54,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:27:54,170 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:27:54,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:27:54,172 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:27:54,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:27:54,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:27:54,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:27:54,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:27:54,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:27:54,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:27:54,174 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:27:54,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:27:54,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:27:54,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:27:54,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:27:54,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:27:54,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:27:54,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:27:54,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:27:54,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:27:54,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:27:54,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:27:54,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:27:54,177 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:27:54,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:27:54,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:27:54,178 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc 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 -> 846c6ea342419c7ea85c72de8af40f1cf8af72c22131b8a3f2ebdacec113c699 [2022-11-02 20:27:54,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:27:54,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:27:54,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:27:54,535 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:27:54,536 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:27:54,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2022-11-02 20:27:54,634 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/data/f2a6d17e7/265be8f6cd034721bfda982c1a9cf872/FLAGdb9099c36 [2022-11-02 20:27:55,260 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:27:55,261 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2022-11-02 20:27:55,269 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/data/f2a6d17e7/265be8f6cd034721bfda982c1a9cf872/FLAGdb9099c36 [2022-11-02 20:27:55,628 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/data/f2a6d17e7/265be8f6cd034721bfda982c1a9cf872 [2022-11-02 20:27:55,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:27:55,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:27:55,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:27:55,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:27:55,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:27:55,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:27:55" (1/1) ... [2022-11-02 20:27:55,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb29337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:55, skipping insertion in model container [2022-11-02 20:27:55,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:27:55" (1/1) ... [2022-11-02 20:27:55,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:27:55,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:27:55,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c[2495,2508] [2022-11-02 20:27:55,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:27:55,980 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:27:56,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c[2495,2508] [2022-11-02 20:27:56,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:27:56,057 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:27:56,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56 WrapperNode [2022-11-02 20:27:56,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:27:56,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:27:56,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:27:56,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:27:56,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,139 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 158 [2022-11-02 20:27:56,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:27:56,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:27:56,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:27:56,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:27:56,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,196 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:27:56,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:27:56,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:27:56,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:27:56,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:27:56,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:27:56,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:27:56,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16209cba-9ea4-4ee9-8df6-47db84da0a03/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:27:56,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:27:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:27:56,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:27:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:27:56,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:27:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:27:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:27:56,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:27:56,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:27:56,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:27:56,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:27:56,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:27:56,323 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:27:56,478 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:27:56,481 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:27:56,891 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:27:56,900 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:27:56,900 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:27:56,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:27:56 BoogieIcfgContainer [2022-11-02 20:27:56,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:27:56,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:27:56,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:27:56,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:27:56,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:27:55" (1/3) ... [2022-11-02 20:27:56,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291e02ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:27:56, skipping insertion in model container [2022-11-02 20:27:56,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56" (2/3) ... [2022-11-02 20:27:56,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291e02ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:27:56, skipping insertion in model container [2022-11-02 20:27:56,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:27:56" (3/3) ... [2022-11-02 20:27:56,944 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2022-11-02 20:27:56,953 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:27:56,988 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:27:56,989 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:27:56,989 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:27:57,157 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 20:27:57,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 210 transitions, 436 flow [2022-11-02 20:27:57,343 INFO L130 PetriNetUnfolder]: 19/208 cut-off events. [2022-11-02 20:27:57,343 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:27:57,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 208 events. 19/208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 415 event pairs, 0 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 131. Up to 2 conditions per place. [2022-11-02 20:27:57,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 210 transitions, 436 flow [2022-11-02 20:27:57,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 199 transitions, 410 flow [2022-11-02 20:27:57,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:27:57,379 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1349996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:27:57,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-02 20:27:57,466 INFO L130 PetriNetUnfolder]: 19/198 cut-off events. [2022-11-02 20:27:57,467 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:27:57,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:57,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:57,468 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:27:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1177191630, now seen corresponding path program 1 times [2022-11-02 20:27:57,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:57,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953767642] [2022-11-02 20:27:57,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:57,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:27:57,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:57,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953767642] [2022-11-02 20:27:57,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953767642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:57,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:57,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:27:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594582048] [2022-11-02 20:27:57,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:57,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:57,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:58,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:58,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:58,041 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 210 [2022-11-02 20:27:58,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 199 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:58,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:58,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 210 [2022-11-02 20:27:58,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:58,207 INFO L130 PetriNetUnfolder]: 43/520 cut-off events. [2022-11-02 20:27:58,207 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-11-02 20:27:58,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 520 events. 43/520 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2772 event pairs, 5 based on Foata normal form. 22/486 useless extension candidates. Maximal degree in co-relation 418. Up to 26 conditions per place. [2022-11-02 20:27:58,216 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 15 selfloop transitions, 3 changer transitions 3/198 dead transitions. [2022-11-02 20:27:58,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 198 transitions, 453 flow [2022-11-02 20:27:58,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 605 transitions. [2022-11-02 20:27:58,235 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9603174603174603 [2022-11-02 20:27:58,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 605 transitions. [2022-11-02 20:27:58,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 605 transitions. [2022-11-02 20:27:58,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:58,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 605 transitions. [2022-11-02 20:27:58,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:58,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:58,258 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:58,261 INFO L175 Difference]: Start difference. First operand has 187 places, 199 transitions, 410 flow. Second operand 3 states and 605 transitions. [2022-11-02 20:27:58,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 198 transitions, 453 flow [2022-11-02 20:27:58,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 198 transitions, 439 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:27:58,274 INFO L231 Difference]: Finished difference. Result has 187 places, 192 transitions, 412 flow [2022-11-02 20:27:58,277 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=187, PETRI_TRANSITIONS=192} [2022-11-02 20:27:58,281 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2022-11-02 20:27:58,282 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 192 transitions, 412 flow [2022-11-02 20:27:58,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:58,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:58,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:58,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:27:58,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:27:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash -991888472, now seen corresponding path program 2 times [2022-11-02 20:27:58,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:58,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464199706] [2022-11-02 20:27:58,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:58,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:27:58,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:58,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464199706] [2022-11-02 20:27:58,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464199706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:58,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:58,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:27:58,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276160825] [2022-11-02 20:27:58,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:58,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:58,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:58,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:58,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:58,538 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 210 [2022-11-02 20:27:58,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 192 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:58,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:58,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 210 [2022-11-02 20:27:58,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:58,759 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([621] thread2EXIT-->L69-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem26#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][170], [159#L69-2true, Black: 201#true, 203#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 209#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))]) [2022-11-02 20:27:58,759 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-02 20:27:58,759 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:27:58,760 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:27:58,760 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:27:58,761 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([621] thread2EXIT-->L69-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem26#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][170], [159#L69-2true, Black: 201#true, 203#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 209#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))]) [2022-11-02 20:27:58,761 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is not cut-off event [2022-11-02 20:27:58,762 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-11-02 20:27:58,762 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-02 20:27:58,762 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-02 20:27:58,762 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-02 20:27:58,776 INFO L130 PetriNetUnfolder]: 43/801 cut-off events. [2022-11-02 20:27:58,776 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-11-02 20:27:58,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 801 events. 43/801 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5617 event pairs, 11 based on Foata normal form. 0/757 useless extension candidates. Maximal degree in co-relation 544. Up to 41 conditions per place. [2022-11-02 20:27:58,784 INFO L137 encePairwiseOnDemand]: 204/210 looper letters, 15 selfloop transitions, 3 changer transitions 0/198 dead transitions. [2022-11-02 20:27:58,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 198 transitions, 463 flow [2022-11-02 20:27:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2022-11-02 20:27:58,787 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9380952380952381 [2022-11-02 20:27:58,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 591 transitions. [2022-11-02 20:27:58,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions. [2022-11-02 20:27:58,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:58,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions. [2022-11-02 20:27:58,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:58,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:58,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:58,794 INFO L175 Difference]: Start difference. First operand has 187 places, 192 transitions, 412 flow. Second operand 3 states and 591 transitions. [2022-11-02 20:27:58,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 198 transitions, 463 flow [2022-11-02 20:27:58,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 198 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:27:58,800 INFO L231 Difference]: Finished difference. Result has 187 places, 195 transitions, 439 flow [2022-11-02 20:27:58,801 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=439, PETRI_PLACES=187, PETRI_TRANSITIONS=195} [2022-11-02 20:27:58,802 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2022-11-02 20:27:58,802 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 195 transitions, 439 flow [2022-11-02 20:27:58,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:58,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:58,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:58,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:27:58,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:27:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:58,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1205751964, now seen corresponding path program 1 times [2022-11-02 20:27:58,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:58,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254983141] [2022-11-02 20:27:58,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:58,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:27:59,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:59,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254983141] [2022-11-02 20:27:59,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254983141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:59,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:59,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:27:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173091512] [2022-11-02 20:27:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:59,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:59,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:59,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:59,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:59,026 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 210 [2022-11-02 20:27:59,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 195 transitions, 439 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:59,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:59,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 210 [2022-11-02 20:27:59,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:59,231 INFO L130 PetriNetUnfolder]: 37/733 cut-off events. [2022-11-02 20:27:59,231 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-02 20:27:59,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 733 events. 37/733 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4667 event pairs, 8 based on Foata normal form. 8/696 useless extension candidates. Maximal degree in co-relation 548. Up to 27 conditions per place. [2022-11-02 20:27:59,240 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 16 selfloop transitions, 5 changer transitions 0/201 dead transitions. [2022-11-02 20:27:59,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 201 transitions, 502 flow [2022-11-02 20:27:59,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2022-11-02 20:27:59,245 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9380952380952381 [2022-11-02 20:27:59,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 591 transitions. [2022-11-02 20:27:59,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions. [2022-11-02 20:27:59,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:59,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions. [2022-11-02 20:27:59,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:59,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:59,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:59,253 INFO L175 Difference]: Start difference. First operand has 187 places, 195 transitions, 439 flow. Second operand 3 states and 591 transitions. [2022-11-02 20:27:59,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 201 transitions, 502 flow [2022-11-02 20:27:59,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 201 transitions, 499 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:27:59,267 INFO L231 Difference]: Finished difference. Result has 190 places, 198 transitions, 480 flow [2022-11-02 20:27:59,268 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=190, PETRI_TRANSITIONS=198} [2022-11-02 20:27:59,271 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 3 predicate places. [2022-11-02 20:27:59,271 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 198 transitions, 480 flow [2022-11-02 20:27:59,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:59,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:59,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:59,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:27:59,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:27:59,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1381057380, now seen corresponding path program 1 times [2022-11-02 20:27:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:59,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896221885] [2022-11-02 20:27:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:59,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:27:59,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:59,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896221885] [2022-11-02 20:27:59,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896221885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:59,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:59,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:27:59,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661216918] [2022-11-02 20:27:59,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:59,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:59,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:59,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:59,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:59,382 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 210 [2022-11-02 20:27:59,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 198 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:59,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:59,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 210 [2022-11-02 20:27:59,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:59,544 INFO L130 PetriNetUnfolder]: 29/640 cut-off events. [2022-11-02 20:27:59,544 INFO L131 PetriNetUnfolder]: For 51/64 co-relation queries the response was YES. [2022-11-02 20:27:59,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 640 events. 29/640 cut-off events. For 51/64 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3690 event pairs, 5 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 292. Up to 23 conditions per place. [2022-11-02 20:27:59,548 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 16 selfloop transitions, 5 changer transitions 0/204 dead transitions. [2022-11-02 20:27:59,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 204 transitions, 543 flow [2022-11-02 20:27:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2022-11-02 20:27:59,551 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9380952380952381 [2022-11-02 20:27:59,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 591 transitions. [2022-11-02 20:27:59,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions. [2022-11-02 20:27:59,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:59,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions. [2022-11-02 20:27:59,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:59,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:59,555 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:59,555 INFO L175 Difference]: Start difference. First operand has 190 places, 198 transitions, 480 flow. Second operand 3 states and 591 transitions. [2022-11-02 20:27:59,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 204 transitions, 543 flow [2022-11-02 20:27:59,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 204 transitions, 527 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-02 20:27:59,561 INFO L231 Difference]: Finished difference. Result has 192 places, 201 transitions, 508 flow [2022-11-02 20:27:59,561 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=192, PETRI_TRANSITIONS=201} [2022-11-02 20:27:59,562 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 5 predicate places. [2022-11-02 20:27:59,562 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 201 transitions, 508 flow [2022-11-02 20:27:59,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:59,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:59,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:59,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:27:59,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:27:59,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:59,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1875137304, now seen corresponding path program 1 times [2022-11-02 20:27:59,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:59,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787783764] [2022-11-02 20:27:59,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:59,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:27:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:59,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787783764] [2022-11-02 20:27:59,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787783764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:59,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:59,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:27:59,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060568799] [2022-11-02 20:27:59,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:59,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:27:59,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:59,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:27:59,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:27:59,992 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:27:59,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 201 transitions, 508 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:59,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:59,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:27:59,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:00,477 INFO L130 PetriNetUnfolder]: 146/1089 cut-off events. [2022-11-02 20:28:00,477 INFO L131 PetriNetUnfolder]: For 52/74 co-relation queries the response was YES. [2022-11-02 20:28:00,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1089 events. 146/1089 cut-off events. For 52/74 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7970 event pairs, 57 based on Foata normal form. 1/1025 useless extension candidates. Maximal degree in co-relation 800. Up to 174 conditions per place. [2022-11-02 20:28:00,488 INFO L137 encePairwiseOnDemand]: 195/210 looper letters, 36 selfloop transitions, 5 changer transitions 51/257 dead transitions. [2022-11-02 20:28:00,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 257 transitions, 803 flow [2022-11-02 20:28:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:28:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:28:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2427 transitions. [2022-11-02 20:28:00,494 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8255102040816327 [2022-11-02 20:28:00,494 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2427 transitions. [2022-11-02 20:28:00,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2427 transitions. [2022-11-02 20:28:00,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:00,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2427 transitions. [2022-11-02 20:28:00,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 173.35714285714286) internal successors, (2427), 14 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:00,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 210.0) internal successors, (3150), 15 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:00,511 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 210.0) internal successors, (3150), 15 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:00,511 INFO L175 Difference]: Start difference. First operand has 192 places, 201 transitions, 508 flow. Second operand 14 states and 2427 transitions. [2022-11-02 20:28:00,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 257 transitions, 803 flow [2022-11-02 20:28:00,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 257 transitions, 787 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:00,517 INFO L231 Difference]: Finished difference. Result has 214 places, 197 transitions, 527 flow [2022-11-02 20:28:00,518 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=527, PETRI_PLACES=214, PETRI_TRANSITIONS=197} [2022-11-02 20:28:00,519 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 27 predicate places. [2022-11-02 20:28:00,519 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 197 transitions, 527 flow [2022-11-02 20:28:00,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:00,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:00,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:00,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:28:00,520 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:00,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:00,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1516500952, now seen corresponding path program 1 times [2022-11-02 20:28:00,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:00,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152572927] [2022-11-02 20:28:00,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:00,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:00,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:00,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152572927] [2022-11-02 20:28:00,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152572927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:00,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:00,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:00,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058885543] [2022-11-02 20:28:00,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:00,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:00,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:00,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:00,940 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:00,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 197 transitions, 527 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:00,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:00,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:00,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:01,758 INFO L130 PetriNetUnfolder]: 132/952 cut-off events. [2022-11-02 20:28:01,759 INFO L131 PetriNetUnfolder]: For 576/587 co-relation queries the response was YES. [2022-11-02 20:28:01,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1836 conditions, 952 events. 132/952 cut-off events. For 576/587 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6604 event pairs, 54 based on Foata normal form. 1/905 useless extension candidates. Maximal degree in co-relation 1803. Up to 193 conditions per place. [2022-11-02 20:28:01,769 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 69 selfloop transitions, 6 changer transitions 41/280 dead transitions. [2022-11-02 20:28:01,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 280 transitions, 1087 flow [2022-11-02 20:28:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:28:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-02 20:28:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4122 transitions. [2022-11-02 20:28:01,782 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8178571428571428 [2022-11-02 20:28:01,782 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4122 transitions. [2022-11-02 20:28:01,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4122 transitions. [2022-11-02 20:28:01,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:01,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4122 transitions. [2022-11-02 20:28:01,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 171.75) internal successors, (4122), 24 states have internal predecessors, (4122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:01,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 210.0) internal successors, (5250), 25 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:01,815 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 210.0) internal successors, (5250), 25 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:01,815 INFO L175 Difference]: Start difference. First operand has 214 places, 197 transitions, 527 flow. Second operand 24 states and 4122 transitions. [2022-11-02 20:28:01,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 280 transitions, 1087 flow [2022-11-02 20:28:01,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 280 transitions, 1018 flow, removed 32 selfloop flow, removed 7 redundant places. [2022-11-02 20:28:01,828 INFO L231 Difference]: Finished difference. Result has 239 places, 201 transitions, 610 flow [2022-11-02 20:28:01,829 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=610, PETRI_PLACES=239, PETRI_TRANSITIONS=201} [2022-11-02 20:28:01,830 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 52 predicate places. [2022-11-02 20:28:01,831 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 201 transitions, 610 flow [2022-11-02 20:28:01,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:01,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:01,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:01,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:28:01,833 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:01,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1256818394, now seen corresponding path program 1 times [2022-11-02 20:28:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:01,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5075509] [2022-11-02 20:28:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:01,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:02,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:02,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5075509] [2022-11-02 20:28:02,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5075509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:02,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:02,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:02,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536115362] [2022-11-02 20:28:02,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:02,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:02,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:02,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:02,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:02,216 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:02,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 201 transitions, 610 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:02,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:02,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:02,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:02,746 INFO L130 PetriNetUnfolder]: 156/1132 cut-off events. [2022-11-02 20:28:02,746 INFO L131 PetriNetUnfolder]: For 2175/2188 co-relation queries the response was YES. [2022-11-02 20:28:02,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2573 conditions, 1132 events. 156/1132 cut-off events. For 2175/2188 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8307 event pairs, 73 based on Foata normal form. 2/1065 useless extension candidates. Maximal degree in co-relation 2495. Up to 229 conditions per place. [2022-11-02 20:28:02,759 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 52 selfloop transitions, 14 changer transitions 21/252 dead transitions. [2022-11-02 20:28:02,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 252 transitions, 1149 flow [2022-11-02 20:28:02,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:28:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:28:02,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2751 transitions. [2022-11-02 20:28:02,765 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.81875 [2022-11-02 20:28:02,766 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2751 transitions. [2022-11-02 20:28:02,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2751 transitions. [2022-11-02 20:28:02,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:02,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2751 transitions. [2022-11-02 20:28:02,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 171.9375) internal successors, (2751), 16 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:02,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 210.0) internal successors, (3570), 17 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:02,783 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 210.0) internal successors, (3570), 17 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:02,783 INFO L175 Difference]: Start difference. First operand has 239 places, 201 transitions, 610 flow. Second operand 16 states and 2751 transitions. [2022-11-02 20:28:02,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 252 transitions, 1149 flow [2022-11-02 20:28:02,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 252 transitions, 1034 flow, removed 56 selfloop flow, removed 13 redundant places. [2022-11-02 20:28:02,805 INFO L231 Difference]: Finished difference. Result has 237 places, 213 transitions, 736 flow [2022-11-02 20:28:02,806 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=736, PETRI_PLACES=237, PETRI_TRANSITIONS=213} [2022-11-02 20:28:02,807 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 50 predicate places. [2022-11-02 20:28:02,808 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 213 transitions, 736 flow [2022-11-02 20:28:02,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:02,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:02,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:02,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:28:02,811 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:02,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:02,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1658436330, now seen corresponding path program 2 times [2022-11-02 20:28:02,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:02,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53666658] [2022-11-02 20:28:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:02,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:03,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53666658] [2022-11-02 20:28:03,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53666658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:03,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:03,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:03,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155801043] [2022-11-02 20:28:03,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:03,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:03,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:03,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:03,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:03,121 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:03,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 213 transitions, 736 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:03,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:03,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:03,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:03,622 INFO L130 PetriNetUnfolder]: 162/1057 cut-off events. [2022-11-02 20:28:03,622 INFO L131 PetriNetUnfolder]: For 2148/2163 co-relation queries the response was YES. [2022-11-02 20:28:03,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 1057 events. 162/1057 cut-off events. For 2148/2163 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7494 event pairs, 68 based on Foata normal form. 2/1003 useless extension candidates. Maximal degree in co-relation 2588. Up to 258 conditions per place. [2022-11-02 20:28:03,637 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 61 selfloop transitions, 16 changer transitions 25/269 dead transitions. [2022-11-02 20:28:03,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 269 transitions, 1357 flow [2022-11-02 20:28:03,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:28:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 20:28:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2925 transitions. [2022-11-02 20:28:03,645 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.819327731092437 [2022-11-02 20:28:03,645 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2925 transitions. [2022-11-02 20:28:03,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2925 transitions. [2022-11-02 20:28:03,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:03,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2925 transitions. [2022-11-02 20:28:03,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 172.05882352941177) internal successors, (2925), 17 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:03,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:03,678 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:03,678 INFO L175 Difference]: Start difference. First operand has 237 places, 213 transitions, 736 flow. Second operand 17 states and 2925 transitions. [2022-11-02 20:28:03,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 269 transitions, 1357 flow [2022-11-02 20:28:03,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 269 transitions, 1279 flow, removed 38 selfloop flow, removed 8 redundant places. [2022-11-02 20:28:03,695 INFO L231 Difference]: Finished difference. Result has 250 places, 228 transitions, 900 flow [2022-11-02 20:28:03,696 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=900, PETRI_PLACES=250, PETRI_TRANSITIONS=228} [2022-11-02 20:28:03,699 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 63 predicate places. [2022-11-02 20:28:03,699 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 228 transitions, 900 flow [2022-11-02 20:28:03,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:03,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:03,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:03,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:28:03,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:03,701 INFO L85 PathProgramCache]: Analyzing trace with hash 719690348, now seen corresponding path program 3 times [2022-11-02 20:28:03,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:03,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417743699] [2022-11-02 20:28:03,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:03,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:04,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:04,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417743699] [2022-11-02 20:28:04,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417743699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:04,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:04,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:04,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896046753] [2022-11-02 20:28:04,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:04,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:04,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:04,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:04,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:04,014 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:04,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 228 transitions, 900 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:04,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:04,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:04,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:04,589 INFO L130 PetriNetUnfolder]: 171/1106 cut-off events. [2022-11-02 20:28:04,589 INFO L131 PetriNetUnfolder]: For 2735/2753 co-relation queries the response was YES. [2022-11-02 20:28:04,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3008 conditions, 1106 events. 171/1106 cut-off events. For 2735/2753 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7910 event pairs, 68 based on Foata normal form. 1/1045 useless extension candidates. Maximal degree in co-relation 2923. Up to 247 conditions per place. [2022-11-02 20:28:04,608 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 68 selfloop transitions, 23 changer transitions 26/284 dead transitions. [2022-11-02 20:28:04,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 284 transitions, 1629 flow [2022-11-02 20:28:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:28:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:28:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2756 transitions. [2022-11-02 20:28:04,615 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8202380952380952 [2022-11-02 20:28:04,616 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2756 transitions. [2022-11-02 20:28:04,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2756 transitions. [2022-11-02 20:28:04,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:04,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2756 transitions. [2022-11-02 20:28:04,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 172.25) internal successors, (2756), 16 states have internal predecessors, (2756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:04,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 210.0) internal successors, (3570), 17 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:04,636 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 210.0) internal successors, (3570), 17 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:04,636 INFO L175 Difference]: Start difference. First operand has 250 places, 228 transitions, 900 flow. Second operand 16 states and 2756 transitions. [2022-11-02 20:28:04,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 284 transitions, 1629 flow [2022-11-02 20:28:04,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 284 transitions, 1506 flow, removed 59 selfloop flow, removed 7 redundant places. [2022-11-02 20:28:04,660 INFO L231 Difference]: Finished difference. Result has 263 places, 241 transitions, 1066 flow [2022-11-02 20:28:04,660 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1066, PETRI_PLACES=263, PETRI_TRANSITIONS=241} [2022-11-02 20:28:04,662 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 76 predicate places. [2022-11-02 20:28:04,662 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 241 transitions, 1066 flow [2022-11-02 20:28:04,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:04,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:04,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:04,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:28:04,664 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:04,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:04,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1195703636, now seen corresponding path program 4 times [2022-11-02 20:28:04,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:04,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115871378] [2022-11-02 20:28:04,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:04,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:04,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:04,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115871378] [2022-11-02 20:28:04,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115871378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:04,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:04,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:04,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487876216] [2022-11-02 20:28:04,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:04,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:05,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:05,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:05,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:05,004 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:05,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 241 transitions, 1066 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:05,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:05,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:05,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:05,657 INFO L130 PetriNetUnfolder]: 171/1115 cut-off events. [2022-11-02 20:28:05,657 INFO L131 PetriNetUnfolder]: For 3495/3512 co-relation queries the response was YES. [2022-11-02 20:28:05,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3206 conditions, 1115 events. 171/1115 cut-off events. For 3495/3512 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 8054 event pairs, 64 based on Foata normal form. 1/1054 useless extension candidates. Maximal degree in co-relation 3114. Up to 215 conditions per place. [2022-11-02 20:28:05,672 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 95 selfloop transitions, 20 changer transitions 39/321 dead transitions. [2022-11-02 20:28:05,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 321 transitions, 2109 flow [2022-11-02 20:28:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:28:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-02 20:28:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4120 transitions. [2022-11-02 20:28:05,680 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8174603174603174 [2022-11-02 20:28:05,680 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4120 transitions. [2022-11-02 20:28:05,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4120 transitions. [2022-11-02 20:28:05,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:05,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4120 transitions. [2022-11-02 20:28:05,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 171.66666666666666) internal successors, (4120), 24 states have internal predecessors, (4120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:05,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 210.0) internal successors, (5250), 25 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:05,700 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 210.0) internal successors, (5250), 25 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:05,701 INFO L175 Difference]: Start difference. First operand has 263 places, 241 transitions, 1066 flow. Second operand 24 states and 4120 transitions. [2022-11-02 20:28:05,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 321 transitions, 2109 flow [2022-11-02 20:28:05,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 321 transitions, 1911 flow, removed 97 selfloop flow, removed 7 redundant places. [2022-11-02 20:28:05,728 INFO L231 Difference]: Finished difference. Result has 291 places, 243 transitions, 1121 flow [2022-11-02 20:28:05,728 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1121, PETRI_PLACES=291, PETRI_TRANSITIONS=243} [2022-11-02 20:28:05,729 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 104 predicate places. [2022-11-02 20:28:05,729 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 243 transitions, 1121 flow [2022-11-02 20:28:05,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:05,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:05,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:05,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:28:05,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:05,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:05,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2039828210, now seen corresponding path program 5 times [2022-11-02 20:28:05,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:05,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947277122] [2022-11-02 20:28:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:05,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:06,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:06,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947277122] [2022-11-02 20:28:06,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947277122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:06,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:06,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:06,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285769520] [2022-11-02 20:28:06,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:06,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:06,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:06,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:06,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:06,043 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:06,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 243 transitions, 1121 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:06,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:06,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:06,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:06,716 INFO L130 PetriNetUnfolder]: 186/1196 cut-off events. [2022-11-02 20:28:06,716 INFO L131 PetriNetUnfolder]: For 4630/4651 co-relation queries the response was YES. [2022-11-02 20:28:06,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3653 conditions, 1196 events. 186/1196 cut-off events. For 4630/4651 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8881 event pairs, 68 based on Foata normal form. 4/1139 useless extension candidates. Maximal degree in co-relation 3562. Up to 266 conditions per place. [2022-11-02 20:28:06,734 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 87 selfloop transitions, 23 changer transitions 32/309 dead transitions. [2022-11-02 20:28:06,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 309 transitions, 2189 flow [2022-11-02 20:28:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:28:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-02 20:28:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3770 transitions. [2022-11-02 20:28:06,740 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.816017316017316 [2022-11-02 20:28:06,741 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3770 transitions. [2022-11-02 20:28:06,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3770 transitions. [2022-11-02 20:28:06,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:06,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3770 transitions. [2022-11-02 20:28:06,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 171.36363636363637) internal successors, (3770), 22 states have internal predecessors, (3770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:06,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 210.0) internal successors, (4830), 23 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:06,763 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 210.0) internal successors, (4830), 23 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:06,763 INFO L175 Difference]: Start difference. First operand has 291 places, 243 transitions, 1121 flow. Second operand 22 states and 3770 transitions. [2022-11-02 20:28:06,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 309 transitions, 2189 flow [2022-11-02 20:28:06,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 309 transitions, 2043 flow, removed 49 selfloop flow, removed 17 redundant places. [2022-11-02 20:28:06,795 INFO L231 Difference]: Finished difference. Result has 293 places, 254 transitions, 1305 flow [2022-11-02 20:28:06,795 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1305, PETRI_PLACES=293, PETRI_TRANSITIONS=254} [2022-11-02 20:28:06,796 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 106 predicate places. [2022-11-02 20:28:06,796 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 254 transitions, 1305 flow [2022-11-02 20:28:06,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:06,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:06,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:06,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:28:06,798 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:06,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1124620506, now seen corresponding path program 2 times [2022-11-02 20:28:06,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:06,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649868962] [2022-11-02 20:28:06,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:06,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:07,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:07,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649868962] [2022-11-02 20:28:07,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649868962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:07,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:07,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:07,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123936611] [2022-11-02 20:28:07,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:07,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:07,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:07,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:07,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:07,085 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:07,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 254 transitions, 1305 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:07,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:07,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:07,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:07,628 INFO L130 PetriNetUnfolder]: 225/1210 cut-off events. [2022-11-02 20:28:07,628 INFO L131 PetriNetUnfolder]: For 4991/5014 co-relation queries the response was YES. [2022-11-02 20:28:07,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4013 conditions, 1210 events. 225/1210 cut-off events. For 4991/5014 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8864 event pairs, 98 based on Foata normal form. 1/1155 useless extension candidates. Maximal degree in co-relation 3908. Up to 349 conditions per place. [2022-11-02 20:28:07,650 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 91 selfloop transitions, 18 changer transitions 21/311 dead transitions. [2022-11-02 20:28:07,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 311 transitions, 2046 flow [2022-11-02 20:28:07,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:28:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 20:28:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2922 transitions. [2022-11-02 20:28:07,657 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8184873949579832 [2022-11-02 20:28:07,658 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2922 transitions. [2022-11-02 20:28:07,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2922 transitions. [2022-11-02 20:28:07,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:07,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2922 transitions. [2022-11-02 20:28:07,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 171.88235294117646) internal successors, (2922), 17 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:07,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:07,675 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:07,675 INFO L175 Difference]: Start difference. First operand has 293 places, 254 transitions, 1305 flow. Second operand 17 states and 2922 transitions. [2022-11-02 20:28:07,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 311 transitions, 2046 flow [2022-11-02 20:28:07,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 311 transitions, 2004 flow, removed 17 selfloop flow, removed 11 redundant places. [2022-11-02 20:28:07,715 INFO L231 Difference]: Finished difference. Result has 296 places, 270 transitions, 1489 flow [2022-11-02 20:28:07,716 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1489, PETRI_PLACES=296, PETRI_TRANSITIONS=270} [2022-11-02 20:28:07,717 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 109 predicate places. [2022-11-02 20:28:07,717 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 270 transitions, 1489 flow [2022-11-02 20:28:07,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:07,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:07,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:07,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:28:07,720 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash -41915474, now seen corresponding path program 3 times [2022-11-02 20:28:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:07,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504106363] [2022-11-02 20:28:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:08,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:08,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504106363] [2022-11-02 20:28:08,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504106363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:08,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:08,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:08,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822397194] [2022-11-02 20:28:08,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:08,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:08,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:08,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:08,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:08,057 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:08,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 270 transitions, 1489 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:08,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:08,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:08,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:08,763 INFO L130 PetriNetUnfolder]: 228/1233 cut-off events. [2022-11-02 20:28:08,763 INFO L131 PetriNetUnfolder]: For 5937/5962 co-relation queries the response was YES. [2022-11-02 20:28:08,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4310 conditions, 1233 events. 228/1233 cut-off events. For 5937/5962 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9138 event pairs, 78 based on Foata normal form. 3/1187 useless extension candidates. Maximal degree in co-relation 4173. Up to 302 conditions per place. [2022-11-02 20:28:08,787 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 121 selfloop transitions, 17 changer transitions 37/356 dead transitions. [2022-11-02 20:28:08,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 356 transitions, 2693 flow [2022-11-02 20:28:08,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:28:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-02 20:28:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4119 transitions. [2022-11-02 20:28:08,830 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8172619047619047 [2022-11-02 20:28:08,830 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4119 transitions. [2022-11-02 20:28:08,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4119 transitions. [2022-11-02 20:28:08,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:08,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4119 transitions. [2022-11-02 20:28:08,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 171.625) internal successors, (4119), 24 states have internal predecessors, (4119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:08,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 210.0) internal successors, (5250), 25 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:08,849 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 210.0) internal successors, (5250), 25 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:08,849 INFO L175 Difference]: Start difference. First operand has 296 places, 270 transitions, 1489 flow. Second operand 24 states and 4119 transitions. [2022-11-02 20:28:08,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 356 transitions, 2693 flow [2022-11-02 20:28:08,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 356 transitions, 2576 flow, removed 56 selfloop flow, removed 7 redundant places. [2022-11-02 20:28:08,895 INFO L231 Difference]: Finished difference. Result has 325 places, 274 transitions, 1595 flow [2022-11-02 20:28:08,895 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1595, PETRI_PLACES=325, PETRI_TRANSITIONS=274} [2022-11-02 20:28:08,897 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 138 predicate places. [2022-11-02 20:28:08,897 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 274 transitions, 1595 flow [2022-11-02 20:28:08,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:08,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:08,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:08,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:28:08,898 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:08,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:08,899 INFO L85 PathProgramCache]: Analyzing trace with hash 115914728, now seen corresponding path program 4 times [2022-11-02 20:28:08,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:08,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219643658] [2022-11-02 20:28:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:08,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:09,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:09,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219643658] [2022-11-02 20:28:09,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219643658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:09,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:09,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908865433] [2022-11-02 20:28:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:09,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:09,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:09,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:09,242 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:09,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 274 transitions, 1595 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:09,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:09,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:09,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:09,806 INFO L130 PetriNetUnfolder]: 232/1247 cut-off events. [2022-11-02 20:28:09,806 INFO L131 PetriNetUnfolder]: For 7601/7631 co-relation queries the response was YES. [2022-11-02 20:28:09,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4693 conditions, 1247 events. 232/1247 cut-off events. For 7601/7631 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9199 event pairs, 89 based on Foata normal form. 4/1199 useless extension candidates. Maximal degree in co-relation 4541. Up to 351 conditions per place. [2022-11-02 20:28:09,830 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 99 selfloop transitions, 25 changer transitions 22/327 dead transitions. [2022-11-02 20:28:09,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 327 transitions, 2640 flow [2022-11-02 20:28:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:28:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:28:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3088 transitions. [2022-11-02 20:28:09,838 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.816931216931217 [2022-11-02 20:28:09,839 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3088 transitions. [2022-11-02 20:28:09,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3088 transitions. [2022-11-02 20:28:09,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:09,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3088 transitions. [2022-11-02 20:28:09,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 171.55555555555554) internal successors, (3088), 18 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:09,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:09,854 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:09,854 INFO L175 Difference]: Start difference. First operand has 325 places, 274 transitions, 1595 flow. Second operand 18 states and 3088 transitions. [2022-11-02 20:28:09,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 327 transitions, 2640 flow [2022-11-02 20:28:09,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 327 transitions, 2446 flow, removed 96 selfloop flow, removed 17 redundant places. [2022-11-02 20:28:09,907 INFO L231 Difference]: Finished difference. Result has 319 places, 287 transitions, 1821 flow [2022-11-02 20:28:09,908 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1535, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1821, PETRI_PLACES=319, PETRI_TRANSITIONS=287} [2022-11-02 20:28:09,909 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 132 predicate places. [2022-11-02 20:28:09,909 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 287 transitions, 1821 flow [2022-11-02 20:28:09,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:09,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:09,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:09,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:28:09,911 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:09,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:09,912 INFO L85 PathProgramCache]: Analyzing trace with hash -678631326, now seen corresponding path program 5 times [2022-11-02 20:28:09,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:09,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134157520] [2022-11-02 20:28:09,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:09,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:10,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:10,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134157520] [2022-11-02 20:28:10,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134157520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:10,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:10,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:10,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712138480] [2022-11-02 20:28:10,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:10,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:10,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:10,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:10,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:10,184 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:10,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 287 transitions, 1821 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:10,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:10,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:10,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:10,787 INFO L130 PetriNetUnfolder]: 235/1265 cut-off events. [2022-11-02 20:28:10,788 INFO L131 PetriNetUnfolder]: For 7213/7242 co-relation queries the response was YES. [2022-11-02 20:28:10,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4709 conditions, 1265 events. 235/1265 cut-off events. For 7213/7242 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9463 event pairs, 90 based on Foata normal form. 1/1211 useless extension candidates. Maximal degree in co-relation 4587. Up to 342 conditions per place. [2022-11-02 20:28:10,810 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 113 selfloop transitions, 22 changer transitions 29/345 dead transitions. [2022-11-02 20:28:10,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 345 transitions, 2893 flow [2022-11-02 20:28:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:28:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-02 20:28:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3431 transitions. [2022-11-02 20:28:10,816 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8169047619047619 [2022-11-02 20:28:10,816 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3431 transitions. [2022-11-02 20:28:10,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3431 transitions. [2022-11-02 20:28:10,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:10,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3431 transitions. [2022-11-02 20:28:10,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 171.55) internal successors, (3431), 20 states have internal predecessors, (3431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:10,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 210.0) internal successors, (4410), 21 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:10,832 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 210.0) internal successors, (4410), 21 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:10,832 INFO L175 Difference]: Start difference. First operand has 319 places, 287 transitions, 1821 flow. Second operand 20 states and 3431 transitions. [2022-11-02 20:28:10,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 345 transitions, 2893 flow [2022-11-02 20:28:10,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 345 transitions, 2749 flow, removed 62 selfloop flow, removed 8 redundant places. [2022-11-02 20:28:10,891 INFO L231 Difference]: Finished difference. Result has 338 places, 298 transitions, 1994 flow [2022-11-02 20:28:10,892 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1733, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1994, PETRI_PLACES=338, PETRI_TRANSITIONS=298} [2022-11-02 20:28:10,893 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 151 predicate places. [2022-11-02 20:28:10,893 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 298 transitions, 1994 flow [2022-11-02 20:28:10,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:10,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:10,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:10,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:28:10,894 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:10,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:10,895 INFO L85 PathProgramCache]: Analyzing trace with hash -431681634, now seen corresponding path program 6 times [2022-11-02 20:28:10,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:10,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594567272] [2022-11-02 20:28:10,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:10,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:11,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:11,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:11,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594567272] [2022-11-02 20:28:11,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594567272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:11,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:11,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:11,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155156016] [2022-11-02 20:28:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:11,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:11,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:11,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:11,190 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:11,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 298 transitions, 1994 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:11,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:11,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:11,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:11,938 INFO L130 PetriNetUnfolder]: 223/1295 cut-off events. [2022-11-02 20:28:11,939 INFO L131 PetriNetUnfolder]: For 7643/7666 co-relation queries the response was YES. [2022-11-02 20:28:11,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4819 conditions, 1295 events. 223/1295 cut-off events. For 7643/7666 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9924 event pairs, 77 based on Foata normal form. 3/1243 useless extension candidates. Maximal degree in co-relation 4651. Up to 329 conditions per place. [2022-11-02 20:28:11,969 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 116 selfloop transitions, 26 changer transitions 33/358 dead transitions. [2022-11-02 20:28:11,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 358 transitions, 3038 flow [2022-11-02 20:28:11,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:28:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-02 20:28:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3436 transitions. [2022-11-02 20:28:11,979 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8180952380952381 [2022-11-02 20:28:11,979 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3436 transitions. [2022-11-02 20:28:11,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3436 transitions. [2022-11-02 20:28:11,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:11,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3436 transitions. [2022-11-02 20:28:11,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 171.8) internal successors, (3436), 20 states have internal predecessors, (3436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:11,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 210.0) internal successors, (4410), 21 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:11,999 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 210.0) internal successors, (4410), 21 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,000 INFO L175 Difference]: Start difference. First operand has 338 places, 298 transitions, 1994 flow. Second operand 20 states and 3436 transitions. [2022-11-02 20:28:12,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 358 transitions, 3038 flow [2022-11-02 20:28:12,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 358 transitions, 2955 flow, removed 36 selfloop flow, removed 12 redundant places. [2022-11-02 20:28:12,074 INFO L231 Difference]: Finished difference. Result has 350 places, 309 transitions, 2201 flow [2022-11-02 20:28:12,075 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1917, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2201, PETRI_PLACES=350, PETRI_TRANSITIONS=309} [2022-11-02 20:28:12,075 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 163 predicate places. [2022-11-02 20:28:12,078 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 309 transitions, 2201 flow [2022-11-02 20:28:12,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:12,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:12,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:28:12,080 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:12,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1204437122, now seen corresponding path program 6 times [2022-11-02 20:28:12,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:12,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077809087] [2022-11-02 20:28:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:12,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:12,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:12,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077809087] [2022-11-02 20:28:12,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077809087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:12,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:12,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204579092] [2022-11-02 20:28:12,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:12,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:12,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:12,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:12,356 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:12,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 309 transitions, 2201 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:12,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:12,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:13,213 INFO L130 PetriNetUnfolder]: 244/1345 cut-off events. [2022-11-02 20:28:13,214 INFO L131 PetriNetUnfolder]: For 8360/8387 co-relation queries the response was YES. [2022-11-02 20:28:13,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 1345 events. 244/1345 cut-off events. For 8360/8387 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10374 event pairs, 88 based on Foata normal form. 3/1297 useless extension candidates. Maximal degree in co-relation 5010. Up to 381 conditions per place. [2022-11-02 20:28:13,243 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 110 selfloop transitions, 28 changer transitions 29/355 dead transitions. [2022-11-02 20:28:13,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 355 transitions, 3077 flow [2022-11-02 20:28:13,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:28:13,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-02 20:28:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3764 transitions. [2022-11-02 20:28:13,259 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8147186147186147 [2022-11-02 20:28:13,260 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3764 transitions. [2022-11-02 20:28:13,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3764 transitions. [2022-11-02 20:28:13,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:13,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3764 transitions. [2022-11-02 20:28:13,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 171.0909090909091) internal successors, (3764), 22 states have internal predecessors, (3764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:13,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 210.0) internal successors, (4830), 23 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:13,287 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 210.0) internal successors, (4830), 23 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:13,287 INFO L175 Difference]: Start difference. First operand has 350 places, 309 transitions, 2201 flow. Second operand 22 states and 3764 transitions. [2022-11-02 20:28:13,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 355 transitions, 3077 flow [2022-11-02 20:28:13,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 355 transitions, 3002 flow, removed 30 selfloop flow, removed 12 redundant places. [2022-11-02 20:28:13,375 INFO L231 Difference]: Finished difference. Result has 362 places, 313 transitions, 2290 flow [2022-11-02 20:28:13,375 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2290, PETRI_PLACES=362, PETRI_TRANSITIONS=313} [2022-11-02 20:28:13,376 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 175 predicate places. [2022-11-02 20:28:13,376 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 313 transitions, 2290 flow [2022-11-02 20:28:13,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:13,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:13,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:13,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:28:13,378 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:13,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash 662991930, now seen corresponding path program 7 times [2022-11-02 20:28:13,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:13,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336744267] [2022-11-02 20:28:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:13,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:13,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:13,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336744267] [2022-11-02 20:28:13,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336744267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:13,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:13,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:13,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879568015] [2022-11-02 20:28:13,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:13,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:13,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:13,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:13,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:13,722 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:13,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 313 transitions, 2290 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:13,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:13,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:13,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:14,639 INFO L130 PetriNetUnfolder]: 217/1331 cut-off events. [2022-11-02 20:28:14,640 INFO L131 PetriNetUnfolder]: For 8093/8116 co-relation queries the response was YES. [2022-11-02 20:28:14,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4931 conditions, 1331 events. 217/1331 cut-off events. For 8093/8116 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 10414 event pairs, 69 based on Foata normal form. 3/1286 useless extension candidates. Maximal degree in co-relation 4753. Up to 343 conditions per place. [2022-11-02 20:28:14,670 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 120 selfloop transitions, 28 changer transitions 33/368 dead transitions. [2022-11-02 20:28:14,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 368 transitions, 3318 flow [2022-11-02 20:28:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:28:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-02 20:28:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3605 transitions. [2022-11-02 20:28:14,676 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8174603174603174 [2022-11-02 20:28:14,676 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3605 transitions. [2022-11-02 20:28:14,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3605 transitions. [2022-11-02 20:28:14,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:14,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3605 transitions. [2022-11-02 20:28:14,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 171.66666666666666) internal successors, (3605), 21 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:14,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 210.0) internal successors, (4620), 22 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:14,702 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 210.0) internal successors, (4620), 22 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:14,702 INFO L175 Difference]: Start difference. First operand has 362 places, 313 transitions, 2290 flow. Second operand 21 states and 3605 transitions. [2022-11-02 20:28:14,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 368 transitions, 3318 flow [2022-11-02 20:28:14,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 368 transitions, 3240 flow, removed 26 selfloop flow, removed 14 redundant places. [2022-11-02 20:28:14,790 INFO L231 Difference]: Finished difference. Result has 370 places, 319 transitions, 2439 flow [2022-11-02 20:28:14,791 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2439, PETRI_PLACES=370, PETRI_TRANSITIONS=319} [2022-11-02 20:28:14,791 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 183 predicate places. [2022-11-02 20:28:14,791 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 319 transitions, 2439 flow [2022-11-02 20:28:14,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:14,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:14,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:14,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:28:14,795 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:14,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash -310699726, now seen corresponding path program 7 times [2022-11-02 20:28:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:14,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145867763] [2022-11-02 20:28:14,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:14,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:15,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:15,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145867763] [2022-11-02 20:28:15,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145867763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:15,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:15,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801088411] [2022-11-02 20:28:15,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:15,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:15,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:15,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:15,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:15,080 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:15,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 319 transitions, 2439 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:15,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:15,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:15,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:15,829 INFO L130 PetriNetUnfolder]: 229/1360 cut-off events. [2022-11-02 20:28:15,830 INFO L131 PetriNetUnfolder]: For 8465/8498 co-relation queries the response was YES. [2022-11-02 20:28:15,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5064 conditions, 1360 events. 229/1360 cut-off events. For 8465/8498 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 10633 event pairs, 77 based on Foata normal form. 1/1316 useless extension candidates. Maximal degree in co-relation 4953. Up to 351 conditions per place. [2022-11-02 20:28:15,857 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 121 selfloop transitions, 28 changer transitions 29/369 dead transitions. [2022-11-02 20:28:15,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 369 transitions, 3487 flow [2022-11-02 20:28:15,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:28:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-02 20:28:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3602 transitions. [2022-11-02 20:28:15,862 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.816780045351474 [2022-11-02 20:28:15,863 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3602 transitions. [2022-11-02 20:28:15,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3602 transitions. [2022-11-02 20:28:15,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:15,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3602 transitions. [2022-11-02 20:28:15,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 171.52380952380952) internal successors, (3602), 21 states have internal predecessors, (3602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:15,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 210.0) internal successors, (4620), 22 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:15,878 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 210.0) internal successors, (4620), 22 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:15,878 INFO L175 Difference]: Start difference. First operand has 370 places, 319 transitions, 2439 flow. Second operand 21 states and 3602 transitions. [2022-11-02 20:28:15,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 369 transitions, 3487 flow [2022-11-02 20:28:15,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 369 transitions, 3389 flow, removed 33 selfloop flow, removed 14 redundant places. [2022-11-02 20:28:15,957 INFO L231 Difference]: Finished difference. Result has 379 places, 326 transitions, 2590 flow [2022-11-02 20:28:15,958 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2341, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2590, PETRI_PLACES=379, PETRI_TRANSITIONS=326} [2022-11-02 20:28:15,958 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 192 predicate places. [2022-11-02 20:28:15,959 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 326 transitions, 2590 flow [2022-11-02 20:28:15,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:15,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:15,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:15,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:28:15,960 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash 519623704, now seen corresponding path program 8 times [2022-11-02 20:28:15,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:15,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260305398] [2022-11-02 20:28:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:16,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:16,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260305398] [2022-11-02 20:28:16,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260305398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:16,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:16,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:16,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078689552] [2022-11-02 20:28:16,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:16,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:16,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:16,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:16,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:16,203 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:16,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 326 transitions, 2590 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:16,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:16,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:16,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:16,865 INFO L130 PetriNetUnfolder]: 222/1321 cut-off events. [2022-11-02 20:28:16,865 INFO L131 PetriNetUnfolder]: For 8455/8497 co-relation queries the response was YES. [2022-11-02 20:28:16,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4998 conditions, 1321 events. 222/1321 cut-off events. For 8455/8497 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 10223 event pairs, 76 based on Foata normal form. 4/1277 useless extension candidates. Maximal degree in co-relation 4823. Up to 367 conditions per place. [2022-11-02 20:28:16,891 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 114 selfloop transitions, 33 changer transitions 29/367 dead transitions. [2022-11-02 20:28:16,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 367 transitions, 3595 flow [2022-11-02 20:28:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:28:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-02 20:28:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3428 transitions. [2022-11-02 20:28:16,896 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8161904761904762 [2022-11-02 20:28:16,896 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3428 transitions. [2022-11-02 20:28:16,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3428 transitions. [2022-11-02 20:28:16,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:16,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3428 transitions. [2022-11-02 20:28:16,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 171.4) internal successors, (3428), 20 states have internal predecessors, (3428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:16,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 210.0) internal successors, (4410), 21 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:16,911 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 210.0) internal successors, (4410), 21 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:16,911 INFO L175 Difference]: Start difference. First operand has 379 places, 326 transitions, 2590 flow. Second operand 20 states and 3428 transitions. [2022-11-02 20:28:16,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 367 transitions, 3595 flow [2022-11-02 20:28:16,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 367 transitions, 3351 flow, removed 85 selfloop flow, removed 15 redundant places. [2022-11-02 20:28:17,004 INFO L231 Difference]: Finished difference. Result has 383 places, 329 transitions, 2636 flow [2022-11-02 20:28:17,005 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2467, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2636, PETRI_PLACES=383, PETRI_TRANSITIONS=329} [2022-11-02 20:28:17,005 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 196 predicate places. [2022-11-02 20:28:17,006 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 329 transitions, 2636 flow [2022-11-02 20:28:17,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:17,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:17,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:17,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:28:17,009 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:17,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:17,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1127967896, now seen corresponding path program 8 times [2022-11-02 20:28:17,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:17,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661771928] [2022-11-02 20:28:17,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:17,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:17,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:17,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661771928] [2022-11-02 20:28:17,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661771928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:17,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:17,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804523475] [2022-11-02 20:28:17,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:17,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:17,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:17,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:17,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:17,264 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:17,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 329 transitions, 2636 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:17,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:17,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:17,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:17,877 INFO L130 PetriNetUnfolder]: 199/1284 cut-off events. [2022-11-02 20:28:17,877 INFO L131 PetriNetUnfolder]: For 7358/7399 co-relation queries the response was YES. [2022-11-02 20:28:17,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4733 conditions, 1284 events. 199/1284 cut-off events. For 7358/7399 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10000 event pairs, 57 based on Foata normal form. 9/1246 useless extension candidates. Maximal degree in co-relation 4617. Up to 349 conditions per place. [2022-11-02 20:28:17,909 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 122 selfloop transitions, 30 changer transitions 28/372 dead transitions. [2022-11-02 20:28:17,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 372 transitions, 3539 flow [2022-11-02 20:28:17,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:28:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:28:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2752 transitions. [2022-11-02 20:28:17,915 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.819047619047619 [2022-11-02 20:28:17,915 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2752 transitions. [2022-11-02 20:28:17,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2752 transitions. [2022-11-02 20:28:17,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:17,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2752 transitions. [2022-11-02 20:28:17,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 172.0) internal successors, (2752), 16 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:17,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 210.0) internal successors, (3570), 17 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:17,928 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 210.0) internal successors, (3570), 17 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:17,929 INFO L175 Difference]: Start difference. First operand has 383 places, 329 transitions, 2636 flow. Second operand 16 states and 2752 transitions. [2022-11-02 20:28:17,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 372 transitions, 3539 flow [2022-11-02 20:28:18,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 372 transitions, 3432 flow, removed 31 selfloop flow, removed 13 redundant places. [2022-11-02 20:28:18,025 INFO L231 Difference]: Finished difference. Result has 381 places, 333 transitions, 2700 flow [2022-11-02 20:28:18,026 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2535, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2700, PETRI_PLACES=381, PETRI_TRANSITIONS=333} [2022-11-02 20:28:18,026 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 194 predicate places. [2022-11-02 20:28:18,027 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 333 transitions, 2700 flow [2022-11-02 20:28:18,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:18,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:18,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:18,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:28:18,029 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:18,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:18,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2024845848, now seen corresponding path program 9 times [2022-11-02 20:28:18,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:18,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605155634] [2022-11-02 20:28:18,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:18,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:18,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:18,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605155634] [2022-11-02 20:28:18,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605155634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:18,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:18,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:18,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543916740] [2022-11-02 20:28:18,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:18,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:18,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:18,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:18,260 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:18,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 333 transitions, 2700 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:18,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:18,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:18,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:19,204 INFO L130 PetriNetUnfolder]: 216/1305 cut-off events. [2022-11-02 20:28:19,205 INFO L131 PetriNetUnfolder]: For 7352/7391 co-relation queries the response was YES. [2022-11-02 20:28:19,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4816 conditions, 1305 events. 216/1305 cut-off events. For 7352/7391 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 10103 event pairs, 72 based on Foata normal form. 1/1260 useless extension candidates. Maximal degree in co-relation 4674. Up to 287 conditions per place. [2022-11-02 20:28:19,234 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 134 selfloop transitions, 41 changer transitions 38/403 dead transitions. [2022-11-02 20:28:19,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 403 transitions, 3840 flow [2022-11-02 20:28:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:28:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-02 20:28:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4115 transitions. [2022-11-02 20:28:19,242 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.816468253968254 [2022-11-02 20:28:19,242 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4115 transitions. [2022-11-02 20:28:19,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4115 transitions. [2022-11-02 20:28:19,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:19,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4115 transitions. [2022-11-02 20:28:19,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 171.45833333333334) internal successors, (4115), 24 states have internal predecessors, (4115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:19,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 210.0) internal successors, (5250), 25 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:19,263 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 210.0) internal successors, (5250), 25 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:19,264 INFO L175 Difference]: Start difference. First operand has 381 places, 333 transitions, 2700 flow. Second operand 24 states and 4115 transitions. [2022-11-02 20:28:19,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 403 transitions, 3840 flow [2022-11-02 20:28:19,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 403 transitions, 3709 flow, removed 36 selfloop flow, removed 10 redundant places. [2022-11-02 20:28:19,350 INFO L231 Difference]: Finished difference. Result has 406 places, 335 transitions, 2801 flow [2022-11-02 20:28:19,351 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2801, PETRI_PLACES=406, PETRI_TRANSITIONS=335} [2022-11-02 20:28:19,352 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 219 predicate places. [2022-11-02 20:28:19,352 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 335 transitions, 2801 flow [2022-11-02 20:28:19,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:19,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:19,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:19,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:28:19,353 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:19,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:19,354 INFO L85 PathProgramCache]: Analyzing trace with hash -265120738, now seen corresponding path program 9 times [2022-11-02 20:28:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:19,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216204024] [2022-11-02 20:28:19,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:19,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:19,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:19,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216204024] [2022-11-02 20:28:19,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216204024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:19,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:19,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536125025] [2022-11-02 20:28:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:19,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:19,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:19,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:19,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:19,616 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:19,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 335 transitions, 2801 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:19,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:19,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:19,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:20,311 INFO L130 PetriNetUnfolder]: 188/1206 cut-off events. [2022-11-02 20:28:20,312 INFO L131 PetriNetUnfolder]: For 7540/7563 co-relation queries the response was YES. [2022-11-02 20:28:20,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 1206 events. 188/1206 cut-off events. For 7540/7563 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 9090 event pairs, 57 based on Foata normal form. 4/1164 useless extension candidates. Maximal degree in co-relation 4435. Up to 336 conditions per place. [2022-11-02 20:28:20,328 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 120 selfloop transitions, 19 changer transitions 33/364 dead transitions. [2022-11-02 20:28:20,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 364 transitions, 3438 flow [2022-11-02 20:28:20,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:28:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:28:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3083 transitions. [2022-11-02 20:28:20,335 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8156084656084656 [2022-11-02 20:28:20,336 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3083 transitions. [2022-11-02 20:28:20,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3083 transitions. [2022-11-02 20:28:20,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:20,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3083 transitions. [2022-11-02 20:28:20,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 171.27777777777777) internal successors, (3083), 18 states have internal predecessors, (3083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:20,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:20,351 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:20,351 INFO L175 Difference]: Start difference. First operand has 406 places, 335 transitions, 2801 flow. Second operand 18 states and 3083 transitions. [2022-11-02 20:28:20,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 364 transitions, 3438 flow [2022-11-02 20:28:20,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 364 transitions, 3338 flow, removed 27 selfloop flow, removed 18 redundant places. [2022-11-02 20:28:20,448 INFO L231 Difference]: Finished difference. Result has 395 places, 321 transitions, 2562 flow [2022-11-02 20:28:20,448 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2707, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2562, PETRI_PLACES=395, PETRI_TRANSITIONS=321} [2022-11-02 20:28:20,449 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 208 predicate places. [2022-11-02 20:28:20,449 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 321 transitions, 2562 flow [2022-11-02 20:28:20,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:20,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:20,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:20,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:28:20,451 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2011907628, now seen corresponding path program 10 times [2022-11-02 20:28:20,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:20,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028875641] [2022-11-02 20:28:20,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:20,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:20,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:20,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028875641] [2022-11-02 20:28:20,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028875641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:20,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:20,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399384564] [2022-11-02 20:28:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:20,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:20,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:20,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:20,709 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:20,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 321 transitions, 2562 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:20,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:20,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:20,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:21,289 INFO L130 PetriNetUnfolder]: 187/1178 cut-off events. [2022-11-02 20:28:21,290 INFO L131 PetriNetUnfolder]: For 6959/6988 co-relation queries the response was YES. [2022-11-02 20:28:21,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4374 conditions, 1178 events. 187/1178 cut-off events. For 6959/6988 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8762 event pairs, 67 based on Foata normal form. 3/1135 useless extension candidates. Maximal degree in co-relation 4228. Up to 318 conditions per place. [2022-11-02 20:28:21,316 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 110 selfloop transitions, 21 changer transitions 27/342 dead transitions. [2022-11-02 20:28:21,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 342 transitions, 3112 flow [2022-11-02 20:28:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:28:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:28:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2742 transitions. [2022-11-02 20:28:21,326 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8160714285714286 [2022-11-02 20:28:21,326 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2742 transitions. [2022-11-02 20:28:21,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2742 transitions. [2022-11-02 20:28:21,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:21,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2742 transitions. [2022-11-02 20:28:21,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 171.375) internal successors, (2742), 16 states have internal predecessors, (2742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:21,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 210.0) internal successors, (3570), 17 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:21,340 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 210.0) internal successors, (3570), 17 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:21,340 INFO L175 Difference]: Start difference. First operand has 395 places, 321 transitions, 2562 flow. Second operand 16 states and 2742 transitions. [2022-11-02 20:28:21,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 342 transitions, 3112 flow [2022-11-02 20:28:21,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 342 transitions, 3036 flow, removed 14 selfloop flow, removed 16 redundant places. [2022-11-02 20:28:21,424 INFO L231 Difference]: Finished difference. Result has 376 places, 305 transitions, 2276 flow [2022-11-02 20:28:21,424 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2486, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2276, PETRI_PLACES=376, PETRI_TRANSITIONS=305} [2022-11-02 20:28:21,425 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 189 predicate places. [2022-11-02 20:28:21,425 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 305 transitions, 2276 flow [2022-11-02 20:28:21,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:21,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:21,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:21,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:28:21,427 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1403334286, now seen corresponding path program 11 times [2022-11-02 20:28:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:21,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244403289] [2022-11-02 20:28:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:21,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:21,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244403289] [2022-11-02 20:28:21,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244403289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:21,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:21,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:21,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045486516] [2022-11-02 20:28:21,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:21,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:21,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:21,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:21,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:21,750 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:21,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 305 transitions, 2276 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:21,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:21,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:21,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:22,340 INFO L130 PetriNetUnfolder]: 184/1165 cut-off events. [2022-11-02 20:28:22,340 INFO L131 PetriNetUnfolder]: For 6478/6504 co-relation queries the response was YES. [2022-11-02 20:28:22,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4228 conditions, 1165 events. 184/1165 cut-off events. For 6478/6504 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 8673 event pairs, 69 based on Foata normal form. 1/1121 useless extension candidates. Maximal degree in co-relation 4134. Up to 312 conditions per place. [2022-11-02 20:28:22,361 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 104 selfloop transitions, 25 changer transitions 26/339 dead transitions. [2022-11-02 20:28:22,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 339 transitions, 3074 flow [2022-11-02 20:28:22,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:28:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:28:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3090 transitions. [2022-11-02 20:28:22,367 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8174603174603174 [2022-11-02 20:28:22,367 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3090 transitions. [2022-11-02 20:28:22,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3090 transitions. [2022-11-02 20:28:22,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:22,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3090 transitions. [2022-11-02 20:28:22,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 171.66666666666666) internal successors, (3090), 18 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:22,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:22,380 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:22,380 INFO L175 Difference]: Start difference. First operand has 376 places, 305 transitions, 2276 flow. Second operand 18 states and 3090 transitions. [2022-11-02 20:28:22,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 339 transitions, 3074 flow [2022-11-02 20:28:22,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 339 transitions, 2937 flow, removed 17 selfloop flow, removed 14 redundant places. [2022-11-02 20:28:22,455 INFO L231 Difference]: Finished difference. Result has 365 places, 307 transitions, 2295 flow [2022-11-02 20:28:22,456 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2295, PETRI_PLACES=365, PETRI_TRANSITIONS=307} [2022-11-02 20:28:22,457 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 178 predicate places. [2022-11-02 20:28:22,457 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 307 transitions, 2295 flow [2022-11-02 20:28:22,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:22,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:22,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:22,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:28:22,459 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:22,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash 669199730, now seen corresponding path program 10 times [2022-11-02 20:28:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:22,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897444994] [2022-11-02 20:28:22,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:22,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:22,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:22,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897444994] [2022-11-02 20:28:22,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897444994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:22,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:22,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:22,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844829914] [2022-11-02 20:28:22,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:22,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:22,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:22,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:22,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:22,695 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:22,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 307 transitions, 2295 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:22,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:22,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:22,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:23,327 INFO L130 PetriNetUnfolder]: 169/1169 cut-off events. [2022-11-02 20:28:23,328 INFO L131 PetriNetUnfolder]: For 5823/5841 co-relation queries the response was YES. [2022-11-02 20:28:23,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4050 conditions, 1169 events. 169/1169 cut-off events. For 5823/5841 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 8829 event pairs, 59 based on Foata normal form. 2/1126 useless extension candidates. Maximal degree in co-relation 3958. Up to 307 conditions per place. [2022-11-02 20:28:23,343 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 113 selfloop transitions, 22 changer transitions 33/352 dead transitions. [2022-11-02 20:28:23,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 352 transitions, 3166 flow [2022-11-02 20:28:23,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:28:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-02 20:28:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3431 transitions. [2022-11-02 20:28:23,351 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8169047619047619 [2022-11-02 20:28:23,352 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3431 transitions. [2022-11-02 20:28:23,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3431 transitions. [2022-11-02 20:28:23,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:23,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3431 transitions. [2022-11-02 20:28:23,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 171.55) internal successors, (3431), 20 states have internal predecessors, (3431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:23,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 210.0) internal successors, (4410), 21 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:23,365 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 210.0) internal successors, (4410), 21 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:23,365 INFO L175 Difference]: Start difference. First operand has 365 places, 307 transitions, 2295 flow. Second operand 20 states and 3431 transitions. [2022-11-02 20:28:23,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 352 transitions, 3166 flow [2022-11-02 20:28:23,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 352 transitions, 3060 flow, removed 34 selfloop flow, removed 8 redundant places. [2022-11-02 20:28:23,433 INFO L231 Difference]: Finished difference. Result has 380 places, 310 transitions, 2328 flow [2022-11-02 20:28:23,434 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2195, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2328, PETRI_PLACES=380, PETRI_TRANSITIONS=310} [2022-11-02 20:28:23,435 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 193 predicate places. [2022-11-02 20:28:23,435 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 310 transitions, 2328 flow [2022-11-02 20:28:23,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:23,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:23,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:23,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:28:23,437 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:23,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1428939116, now seen corresponding path program 12 times [2022-11-02 20:28:23,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:23,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000368883] [2022-11-02 20:28:23,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:23,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:23,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000368883] [2022-11-02 20:28:23,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000368883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:23,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:23,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572012602] [2022-11-02 20:28:23,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:23,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:23,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:23,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:23,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:23,674 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:23,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 310 transitions, 2328 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:23,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:23,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:23,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:24,358 INFO L130 PetriNetUnfolder]: 171/1146 cut-off events. [2022-11-02 20:28:24,358 INFO L131 PetriNetUnfolder]: For 5703/5734 co-relation queries the response was YES. [2022-11-02 20:28:24,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 1146 events. 171/1146 cut-off events. For 5703/5734 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 8559 event pairs, 64 based on Foata normal form. 3/1104 useless extension candidates. Maximal degree in co-relation 3910. Up to 306 conditions per place. [2022-11-02 20:28:24,376 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 104 selfloop transitions, 16 changer transitions 26/331 dead transitions. [2022-11-02 20:28:24,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 331 transitions, 2857 flow [2022-11-02 20:28:24,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:28:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 20:28:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2915 transitions. [2022-11-02 20:28:24,380 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8165266106442577 [2022-11-02 20:28:24,381 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2915 transitions. [2022-11-02 20:28:24,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2915 transitions. [2022-11-02 20:28:24,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:24,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2915 transitions. [2022-11-02 20:28:24,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 171.47058823529412) internal successors, (2915), 17 states have internal predecessors, (2915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:24,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:24,392 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:24,392 INFO L175 Difference]: Start difference. First operand has 380 places, 310 transitions, 2328 flow. Second operand 17 states and 2915 transitions. [2022-11-02 20:28:24,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 331 transitions, 2857 flow [2022-11-02 20:28:24,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 331 transitions, 2760 flow, removed 17 selfloop flow, removed 14 redundant places. [2022-11-02 20:28:24,459 INFO L231 Difference]: Finished difference. Result has 377 places, 301 transitions, 2143 flow [2022-11-02 20:28:24,459 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2143, PETRI_PLACES=377, PETRI_TRANSITIONS=301} [2022-11-02 20:28:24,460 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 190 predicate places. [2022-11-02 20:28:24,460 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 301 transitions, 2143 flow [2022-11-02 20:28:24,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:24,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:24,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:24,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:28:24,462 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:24,462 INFO L85 PathProgramCache]: Analyzing trace with hash -244420862, now seen corresponding path program 13 times [2022-11-02 20:28:24,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:24,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595214545] [2022-11-02 20:28:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:24,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:24,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:24,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595214545] [2022-11-02 20:28:24,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595214545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:24,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:24,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:24,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144699321] [2022-11-02 20:28:24,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:24,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:24,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:24,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:24,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:24,703 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:24,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 301 transitions, 2143 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:24,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:24,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:24,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:25,261 INFO L130 PetriNetUnfolder]: 158/1085 cut-off events. [2022-11-02 20:28:25,262 INFO L131 PetriNetUnfolder]: For 5037/5068 co-relation queries the response was YES. [2022-11-02 20:28:25,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3668 conditions, 1085 events. 158/1085 cut-off events. For 5037/5068 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7915 event pairs, 60 based on Foata normal form. 3/1044 useless extension candidates. Maximal degree in co-relation 3572. Up to 297 conditions per place. [2022-11-02 20:28:25,282 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 94 selfloop transitions, 5 changer transitions 29/313 dead transitions. [2022-11-02 20:28:25,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 313 transitions, 2510 flow [2022-11-02 20:28:25,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:28:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:28:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3074 transitions. [2022-11-02 20:28:25,286 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8132275132275132 [2022-11-02 20:28:25,287 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3074 transitions. [2022-11-02 20:28:25,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3074 transitions. [2022-11-02 20:28:25,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:25,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3074 transitions. [2022-11-02 20:28:25,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 170.77777777777777) internal successors, (3074), 18 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:25,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:25,298 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:25,298 INFO L175 Difference]: Start difference. First operand has 377 places, 301 transitions, 2143 flow. Second operand 18 states and 3074 transitions. [2022-11-02 20:28:25,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 313 transitions, 2510 flow [2022-11-02 20:28:25,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 313 transitions, 2427 flow, removed 16 selfloop flow, removed 17 redundant places. [2022-11-02 20:28:25,352 INFO L231 Difference]: Finished difference. Result has 366 places, 281 transitions, 1819 flow [2022-11-02 20:28:25,353 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1819, PETRI_PLACES=366, PETRI_TRANSITIONS=281} [2022-11-02 20:28:25,353 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 179 predicate places. [2022-11-02 20:28:25,353 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 281 transitions, 1819 flow [2022-11-02 20:28:25,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:25,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:25,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:25,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:28:25,355 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:25,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash 674330360, now seen corresponding path program 11 times [2022-11-02 20:28:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:25,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738264867] [2022-11-02 20:28:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:25,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:25,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738264867] [2022-11-02 20:28:25,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738264867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:25,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:25,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531262453] [2022-11-02 20:28:25,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:25,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:25,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:25,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:25,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:25,609 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:25,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 281 transitions, 1819 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:25,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:25,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:25,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:26,297 INFO L130 PetriNetUnfolder]: 141/1080 cut-off events. [2022-11-02 20:28:26,298 INFO L131 PetriNetUnfolder]: For 4550/4564 co-relation queries the response was YES. [2022-11-02 20:28:26,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3469 conditions, 1080 events. 141/1080 cut-off events. For 4550/4564 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7936 event pairs, 52 based on Foata normal form. 1/1037 useless extension candidates. Maximal degree in co-relation 3378. Up to 255 conditions per place. [2022-11-02 20:28:26,321 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 91 selfloop transitions, 25 changer transitions 30/320 dead transitions. [2022-11-02 20:28:26,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 320 transitions, 2578 flow [2022-11-02 20:28:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:28:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:28:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3093 transitions. [2022-11-02 20:28:26,328 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8182539682539682 [2022-11-02 20:28:26,328 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3093 transitions. [2022-11-02 20:28:26,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3093 transitions. [2022-11-02 20:28:26,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:26,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3093 transitions. [2022-11-02 20:28:26,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 171.83333333333334) internal successors, (3093), 18 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:26,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:26,343 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:26,343 INFO L175 Difference]: Start difference. First operand has 366 places, 281 transitions, 1819 flow. Second operand 18 states and 3093 transitions. [2022-11-02 20:28:26,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 320 transitions, 2578 flow [2022-11-02 20:28:26,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 320 transitions, 2494 flow, removed 24 selfloop flow, removed 20 redundant places. [2022-11-02 20:28:26,392 INFO L231 Difference]: Finished difference. Result has 341 places, 284 transitions, 1878 flow [2022-11-02 20:28:26,392 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1741, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1878, PETRI_PLACES=341, PETRI_TRANSITIONS=284} [2022-11-02 20:28:26,396 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 154 predicate places. [2022-11-02 20:28:26,396 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 284 transitions, 1878 flow [2022-11-02 20:28:26,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:26,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:26,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:26,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:28:26,397 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:26,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:26,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1115231222, now seen corresponding path program 12 times [2022-11-02 20:28:26,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:26,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059398721] [2022-11-02 20:28:26,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:26,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:26,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:26,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059398721] [2022-11-02 20:28:26,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059398721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:26,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:26,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:26,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552310684] [2022-11-02 20:28:26,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:26,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:26,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:26,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:26,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:26,637 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:26,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 284 transitions, 1878 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:26,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:26,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:26,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:27,180 INFO L130 PetriNetUnfolder]: 134/1028 cut-off events. [2022-11-02 20:28:27,181 INFO L131 PetriNetUnfolder]: For 4124/4148 co-relation queries the response was YES. [2022-11-02 20:28:27,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3260 conditions, 1028 events. 134/1028 cut-off events. For 4124/4148 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7395 event pairs, 51 based on Foata normal form. 3/985 useless extension candidates. Maximal degree in co-relation 3179. Up to 253 conditions per place. [2022-11-02 20:28:27,198 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 89 selfloop transitions, 16 changer transitions 30/309 dead transitions. [2022-11-02 20:28:27,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 309 transitions, 2417 flow [2022-11-02 20:28:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:28:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 20:28:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2918 transitions. [2022-11-02 20:28:27,202 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8173669467787115 [2022-11-02 20:28:27,203 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2918 transitions. [2022-11-02 20:28:27,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2918 transitions. [2022-11-02 20:28:27,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:27,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2918 transitions. [2022-11-02 20:28:27,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 171.64705882352942) internal successors, (2918), 17 states have internal predecessors, (2918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:27,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:27,214 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:27,214 INFO L175 Difference]: Start difference. First operand has 341 places, 284 transitions, 1878 flow. Second operand 17 states and 2918 transitions. [2022-11-02 20:28:27,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 309 transitions, 2417 flow [2022-11-02 20:28:27,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 309 transitions, 2304 flow, removed 31 selfloop flow, removed 8 redundant places. [2022-11-02 20:28:27,260 INFO L231 Difference]: Finished difference. Result has 347 places, 275 transitions, 1697 flow [2022-11-02 20:28:27,261 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1697, PETRI_PLACES=347, PETRI_TRANSITIONS=275} [2022-11-02 20:28:27,261 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 160 predicate places. [2022-11-02 20:28:27,262 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 275 transitions, 1697 flow [2022-11-02 20:28:27,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:27,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:27,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:27,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:28:27,263 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:27,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash -208170154, now seen corresponding path program 14 times [2022-11-02 20:28:27,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:27,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073432394] [2022-11-02 20:28:27,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:27,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:27,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073432394] [2022-11-02 20:28:27,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073432394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:27,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:27,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:27,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314952545] [2022-11-02 20:28:27,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:27,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:27,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:27,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:27,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:27,509 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:27,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 275 transitions, 1697 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:27,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:27,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:27,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:28,125 INFO L130 PetriNetUnfolder]: 150/1111 cut-off events. [2022-11-02 20:28:28,125 INFO L131 PetriNetUnfolder]: For 4085/4109 co-relation queries the response was YES. [2022-11-02 20:28:28,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3422 conditions, 1111 events. 150/1111 cut-off events. For 4085/4109 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8313 event pairs, 58 based on Foata normal form. 1/1071 useless extension candidates. Maximal degree in co-relation 3340. Up to 254 conditions per place. [2022-11-02 20:28:28,146 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 90 selfloop transitions, 22 changer transitions 28/323 dead transitions. [2022-11-02 20:28:28,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 323 transitions, 2483 flow [2022-11-02 20:28:28,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:28:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-02 20:28:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3593 transitions. [2022-11-02 20:28:28,152 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8147392290249433 [2022-11-02 20:28:28,152 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3593 transitions. [2022-11-02 20:28:28,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3593 transitions. [2022-11-02 20:28:28,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:28,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3593 transitions. [2022-11-02 20:28:28,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 171.0952380952381) internal successors, (3593), 21 states have internal predecessors, (3593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:28,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 210.0) internal successors, (4620), 22 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:28,167 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 210.0) internal successors, (4620), 22 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:28,167 INFO L175 Difference]: Start difference. First operand has 347 places, 275 transitions, 1697 flow. Second operand 21 states and 3593 transitions. [2022-11-02 20:28:28,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 323 transitions, 2483 flow [2022-11-02 20:28:28,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 323 transitions, 2408 flow, removed 11 selfloop flow, removed 18 redundant places. [2022-11-02 20:28:28,210 INFO L231 Difference]: Finished difference. Result has 348 places, 285 transitions, 1841 flow [2022-11-02 20:28:28,211 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1622, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1841, PETRI_PLACES=348, PETRI_TRANSITIONS=285} [2022-11-02 20:28:28,212 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 161 predicate places. [2022-11-02 20:28:28,212 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 285 transitions, 1841 flow [2022-11-02 20:28:28,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:28,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:28,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:28,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:28:28,215 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:28,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:28,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1425903314, now seen corresponding path program 15 times [2022-11-02 20:28:28,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:28,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304088338] [2022-11-02 20:28:28,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:28,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:28,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:28,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304088338] [2022-11-02 20:28:28,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304088338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:28,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:28,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:28,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443439723] [2022-11-02 20:28:28,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:28,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:28,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:28,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:28,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:28,481 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:28,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 285 transitions, 1841 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:28,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:28,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:28,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:29,099 INFO L130 PetriNetUnfolder]: 148/1071 cut-off events. [2022-11-02 20:28:29,099 INFO L131 PetriNetUnfolder]: For 4116/4140 co-relation queries the response was YES. [2022-11-02 20:28:29,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3427 conditions, 1071 events. 148/1071 cut-off events. For 4116/4140 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 7911 event pairs, 58 based on Foata normal form. 1/1029 useless extension candidates. Maximal degree in co-relation 3341. Up to 251 conditions per place. [2022-11-02 20:28:29,112 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 87 selfloop transitions, 22 changer transitions 31/323 dead transitions. [2022-11-02 20:28:29,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 323 transitions, 2550 flow [2022-11-02 20:28:29,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:28:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-02 20:28:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3760 transitions. [2022-11-02 20:28:29,117 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8138528138528138 [2022-11-02 20:28:29,118 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3760 transitions. [2022-11-02 20:28:29,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3760 transitions. [2022-11-02 20:28:29,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:29,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3760 transitions. [2022-11-02 20:28:29,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 170.9090909090909) internal successors, (3760), 22 states have internal predecessors, (3760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:29,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 210.0) internal successors, (4830), 23 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:29,132 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 210.0) internal successors, (4830), 23 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:29,132 INFO L175 Difference]: Start difference. First operand has 348 places, 285 transitions, 1841 flow. Second operand 22 states and 3760 transitions. [2022-11-02 20:28:29,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 323 transitions, 2550 flow [2022-11-02 20:28:29,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 323 transitions, 2448 flow, removed 38 selfloop flow, removed 12 redundant places. [2022-11-02 20:28:29,181 INFO L231 Difference]: Finished difference. Result has 356 places, 283 transitions, 1848 flow [2022-11-02 20:28:29,182 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1785, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1848, PETRI_PLACES=356, PETRI_TRANSITIONS=283} [2022-11-02 20:28:29,182 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 169 predicate places. [2022-11-02 20:28:29,183 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 283 transitions, 1848 flow [2022-11-02 20:28:29,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:29,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:29,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:29,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:28:29,184 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:29,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash 522731952, now seen corresponding path program 16 times [2022-11-02 20:28:29,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:29,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994941801] [2022-11-02 20:28:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:29,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:29,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:29,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994941801] [2022-11-02 20:28:29,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994941801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:29,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:29,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:29,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414741864] [2022-11-02 20:28:29,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:29,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:29,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:29,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:29,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:29,427 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:29,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 283 transitions, 1848 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:29,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:29,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:29,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:29,948 INFO L130 PetriNetUnfolder]: 134/979 cut-off events. [2022-11-02 20:28:29,949 INFO L131 PetriNetUnfolder]: For 3850/3874 co-relation queries the response was YES. [2022-11-02 20:28:29,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3152 conditions, 979 events. 134/979 cut-off events. For 3850/3874 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6868 event pairs, 54 based on Foata normal form. 1/937 useless extension candidates. Maximal degree in co-relation 3064. Up to 250 conditions per place. [2022-11-02 20:28:29,968 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 80 selfloop transitions, 10 changer transitions 29/302 dead transitions. [2022-11-02 20:28:29,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 302 transitions, 2258 flow [2022-11-02 20:28:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:28:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:28:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3078 transitions. [2022-11-02 20:28:29,973 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8142857142857143 [2022-11-02 20:28:29,973 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3078 transitions. [2022-11-02 20:28:29,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3078 transitions. [2022-11-02 20:28:29,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:29,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3078 transitions. [2022-11-02 20:28:29,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 171.0) internal successors, (3078), 18 states have internal predecessors, (3078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:29,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:29,984 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:29,984 INFO L175 Difference]: Start difference. First operand has 356 places, 283 transitions, 1848 flow. Second operand 18 states and 3078 transitions. [2022-11-02 20:28:29,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 302 transitions, 2258 flow [2022-11-02 20:28:30,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 302 transitions, 2152 flow, removed 27 selfloop flow, removed 17 redundant places. [2022-11-02 20:28:30,033 INFO L231 Difference]: Finished difference. Result has 349 places, 268 transitions, 1606 flow [2022-11-02 20:28:30,033 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1606, PETRI_PLACES=349, PETRI_TRANSITIONS=268} [2022-11-02 20:28:30,034 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 162 predicate places. [2022-11-02 20:28:30,034 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 268 transitions, 1606 flow [2022-11-02 20:28:30,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:30,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:30,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:30,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:28:30,036 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:30,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:30,036 INFO L85 PathProgramCache]: Analyzing trace with hash -611558422, now seen corresponding path program 13 times [2022-11-02 20:28:30,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:30,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326316123] [2022-11-02 20:28:30,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:30,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:30,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:30,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326316123] [2022-11-02 20:28:30,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326316123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:30,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:30,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:30,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886496745] [2022-11-02 20:28:30,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:30,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:30,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:30,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:30,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:30,264 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:30,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 268 transitions, 1606 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:30,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:30,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:30,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:30,814 INFO L130 PetriNetUnfolder]: 111/908 cut-off events. [2022-11-02 20:28:30,815 INFO L131 PetriNetUnfolder]: For 3183/3197 co-relation queries the response was YES. [2022-11-02 20:28:30,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 908 events. 111/908 cut-off events. For 3183/3197 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 6147 event pairs, 47 based on Foata normal form. 1/865 useless extension candidates. Maximal degree in co-relation 2705. Up to 221 conditions per place. [2022-11-02 20:28:30,830 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 73 selfloop transitions, 5 changer transitions 33/284 dead transitions. [2022-11-02 20:28:30,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 284 transitions, 1943 flow [2022-11-02 20:28:30,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:28:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:28:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3077 transitions. [2022-11-02 20:28:30,834 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.814021164021164 [2022-11-02 20:28:30,835 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3077 transitions. [2022-11-02 20:28:30,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3077 transitions. [2022-11-02 20:28:30,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:30,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3077 transitions. [2022-11-02 20:28:30,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 170.94444444444446) internal successors, (3077), 18 states have internal predecessors, (3077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:30,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:30,845 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:30,845 INFO L175 Difference]: Start difference. First operand has 349 places, 268 transitions, 1606 flow. Second operand 18 states and 3077 transitions. [2022-11-02 20:28:30,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 284 transitions, 1943 flow [2022-11-02 20:28:30,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 284 transitions, 1875 flow, removed 14 selfloop flow, removed 16 redundant places. [2022-11-02 20:28:30,882 INFO L231 Difference]: Finished difference. Result has 332 places, 248 transitions, 1290 flow [2022-11-02 20:28:30,883 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1290, PETRI_PLACES=332, PETRI_TRANSITIONS=248} [2022-11-02 20:28:30,883 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 145 predicate places. [2022-11-02 20:28:30,883 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 248 transitions, 1290 flow [2022-11-02 20:28:30,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:30,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:30,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:30,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:28:30,885 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:30,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash 695275872, now seen corresponding path program 14 times [2022-11-02 20:28:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:30,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898570517] [2022-11-02 20:28:30,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:30,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:31,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:31,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898570517] [2022-11-02 20:28:31,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898570517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:31,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:31,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:31,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317923463] [2022-11-02 20:28:31,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:31,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:31,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:31,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:31,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:31,138 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:31,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 248 transitions, 1290 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:31,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:31,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:31,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:31,758 INFO L130 PetriNetUnfolder]: 115/958 cut-off events. [2022-11-02 20:28:31,759 INFO L131 PetriNetUnfolder]: For 3175/3186 co-relation queries the response was YES. [2022-11-02 20:28:31,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 958 events. 115/958 cut-off events. For 3175/3186 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6746 event pairs, 43 based on Foata normal form. 1/919 useless extension candidates. Maximal degree in co-relation 2756. Up to 198 conditions per place. [2022-11-02 20:28:31,775 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 68 selfloop transitions, 22 changer transitions 34/297 dead transitions. [2022-11-02 20:28:31,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 297 transitions, 2089 flow [2022-11-02 20:28:31,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:28:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-02 20:28:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3765 transitions. [2022-11-02 20:28:31,780 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.814935064935065 [2022-11-02 20:28:31,781 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3765 transitions. [2022-11-02 20:28:31,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3765 transitions. [2022-11-02 20:28:31,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:31,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3765 transitions. [2022-11-02 20:28:31,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 171.13636363636363) internal successors, (3765), 22 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:31,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 210.0) internal successors, (4830), 23 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:31,794 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 210.0) internal successors, (4830), 23 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:31,794 INFO L175 Difference]: Start difference. First operand has 332 places, 248 transitions, 1290 flow. Second operand 22 states and 3765 transitions. [2022-11-02 20:28:31,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 297 transitions, 2089 flow [2022-11-02 20:28:31,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 297 transitions, 1933 flow, removed 39 selfloop flow, removed 19 redundant places. [2022-11-02 20:28:31,829 INFO L231 Difference]: Finished difference. Result has 320 places, 253 transitions, 1371 flow [2022-11-02 20:28:31,830 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1371, PETRI_PLACES=320, PETRI_TRANSITIONS=253} [2022-11-02 20:28:31,830 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 133 predicate places. [2022-11-02 20:28:31,830 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 253 transitions, 1371 flow [2022-11-02 20:28:31,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:31,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:31,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:31,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:28:31,832 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1197943842, now seen corresponding path program 17 times [2022-11-02 20:28:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:31,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972711293] [2022-11-02 20:28:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:32,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:32,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972711293] [2022-11-02 20:28:32,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972711293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:32,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:32,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:32,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061112296] [2022-11-02 20:28:32,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:32,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:32,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:32,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:32,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:32,084 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:32,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 253 transitions, 1371 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:32,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:32,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:32,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:32,643 INFO L130 PetriNetUnfolder]: 125/965 cut-off events. [2022-11-02 20:28:32,643 INFO L131 PetriNetUnfolder]: For 3118/3138 co-relation queries the response was YES. [2022-11-02 20:28:32,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2924 conditions, 965 events. 125/965 cut-off events. For 3118/3138 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6816 event pairs, 51 based on Foata normal form. 1/924 useless extension candidates. Maximal degree in co-relation 2849. Up to 226 conditions per place. [2022-11-02 20:28:32,655 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 66 selfloop transitions, 20 changer transitions 24/289 dead transitions. [2022-11-02 20:28:32,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 289 transitions, 1962 flow [2022-11-02 20:28:32,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:28:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:28:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3083 transitions. [2022-11-02 20:28:32,665 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8156084656084656 [2022-11-02 20:28:32,665 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3083 transitions. [2022-11-02 20:28:32,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3083 transitions. [2022-11-02 20:28:32,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:32,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3083 transitions. [2022-11-02 20:28:32,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 171.27777777777777) internal successors, (3083), 18 states have internal predecessors, (3083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:32,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:32,677 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:32,677 INFO L175 Difference]: Start difference. First operand has 320 places, 253 transitions, 1371 flow. Second operand 18 states and 3083 transitions. [2022-11-02 20:28:32,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 289 transitions, 1962 flow [2022-11-02 20:28:32,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 289 transitions, 1910 flow, removed 19 selfloop flow, removed 13 redundant places. [2022-11-02 20:28:32,712 INFO L231 Difference]: Finished difference. Result has 319 places, 262 transitions, 1522 flow [2022-11-02 20:28:32,712 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1522, PETRI_PLACES=319, PETRI_TRANSITIONS=262} [2022-11-02 20:28:32,713 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 132 predicate places. [2022-11-02 20:28:32,713 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 262 transitions, 1522 flow [2022-11-02 20:28:32,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:32,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:32,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:32,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:28:32,715 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:32,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:32,716 INFO L85 PathProgramCache]: Analyzing trace with hash 504291674, now seen corresponding path program 18 times [2022-11-02 20:28:32,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:32,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693891890] [2022-11-02 20:28:32,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:32,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:32,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:32,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693891890] [2022-11-02 20:28:32,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693891890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:32,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:32,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:32,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450613086] [2022-11-02 20:28:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:32,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:32,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:32,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:32,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:32,944 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:32,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 262 transitions, 1522 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:32,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:32,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:32,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:33,486 INFO L130 PetriNetUnfolder]: 122/960 cut-off events. [2022-11-02 20:28:33,486 INFO L131 PetriNetUnfolder]: For 2962/2982 co-relation queries the response was YES. [2022-11-02 20:28:33,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2911 conditions, 960 events. 122/960 cut-off events. For 2962/2982 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6737 event pairs, 53 based on Foata normal form. 1/919 useless extension candidates. Maximal degree in co-relation 2838. Up to 224 conditions per place. [2022-11-02 20:28:33,496 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 63 selfloop transitions, 22 changer transitions 25/289 dead transitions. [2022-11-02 20:28:33,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 289 transitions, 2056 flow [2022-11-02 20:28:33,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:28:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 20:28:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2915 transitions. [2022-11-02 20:28:33,506 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8165266106442577 [2022-11-02 20:28:33,506 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2915 transitions. [2022-11-02 20:28:33,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2915 transitions. [2022-11-02 20:28:33,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:33,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2915 transitions. [2022-11-02 20:28:33,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 171.47058823529412) internal successors, (2915), 17 states have internal predecessors, (2915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:33,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:33,517 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:33,517 INFO L175 Difference]: Start difference. First operand has 319 places, 262 transitions, 1522 flow. Second operand 17 states and 2915 transitions. [2022-11-02 20:28:33,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 289 transitions, 2056 flow [2022-11-02 20:28:33,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 289 transitions, 1952 flow, removed 39 selfloop flow, removed 8 redundant places. [2022-11-02 20:28:33,555 INFO L231 Difference]: Finished difference. Result has 325 places, 262 transitions, 1539 flow [2022-11-02 20:28:33,556 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1539, PETRI_PLACES=325, PETRI_TRANSITIONS=262} [2022-11-02 20:28:33,557 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 138 predicate places. [2022-11-02 20:28:33,557 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 262 transitions, 1539 flow [2022-11-02 20:28:33,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:33,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:33,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:33,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:28:33,559 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:33,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:33,564 INFO L85 PathProgramCache]: Analyzing trace with hash 724650266, now seen corresponding path program 15 times [2022-11-02 20:28:33,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:33,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732872297] [2022-11-02 20:28:33,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:33,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:33,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:33,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732872297] [2022-11-02 20:28:33,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732872297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:33,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:33,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716835411] [2022-11-02 20:28:33,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:33,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:33,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:33,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:33,808 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:33,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 262 transitions, 1539 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:33,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:33,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:33,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:34,444 INFO L130 PetriNetUnfolder]: 112/948 cut-off events. [2022-11-02 20:28:34,445 INFO L131 PetriNetUnfolder]: For 2861/2872 co-relation queries the response was YES. [2022-11-02 20:28:34,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 948 events. 112/948 cut-off events. For 2861/2872 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6664 event pairs, 38 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 2719. Up to 194 conditions per place. [2022-11-02 20:28:34,460 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 80 selfloop transitions, 21 changer transitions 33/307 dead transitions. [2022-11-02 20:28:34,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 307 transitions, 2329 flow [2022-11-02 20:28:34,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:28:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-02 20:28:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3597 transitions. [2022-11-02 20:28:34,465 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8156462585034013 [2022-11-02 20:28:34,466 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3597 transitions. [2022-11-02 20:28:34,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3597 transitions. [2022-11-02 20:28:34,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:34,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3597 transitions. [2022-11-02 20:28:34,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 171.28571428571428) internal successors, (3597), 21 states have internal predecessors, (3597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:34,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 210.0) internal successors, (4620), 22 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:34,477 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 210.0) internal successors, (4620), 22 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:34,477 INFO L175 Difference]: Start difference. First operand has 325 places, 262 transitions, 1539 flow. Second operand 21 states and 3597 transitions. [2022-11-02 20:28:34,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 307 transitions, 2329 flow [2022-11-02 20:28:34,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 307 transitions, 2207 flow, removed 31 selfloop flow, removed 13 redundant places. [2022-11-02 20:28:34,513 INFO L231 Difference]: Finished difference. Result has 337 places, 265 transitions, 1572 flow [2022-11-02 20:28:34,513 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1572, PETRI_PLACES=337, PETRI_TRANSITIONS=265} [2022-11-02 20:28:34,514 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 150 predicate places. [2022-11-02 20:28:34,514 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 265 transitions, 1572 flow [2022-11-02 20:28:34,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:34,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:34,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:34,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:28:34,516 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1876069172, now seen corresponding path program 19 times [2022-11-02 20:28:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:34,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001944257] [2022-11-02 20:28:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:34,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:34,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001944257] [2022-11-02 20:28:34,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001944257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:34,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:34,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716563755] [2022-11-02 20:28:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:34,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:34,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:34,859 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:34,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 265 transitions, 1572 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:34,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:34,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:34,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:35,395 INFO L130 PetriNetUnfolder]: 115/929 cut-off events. [2022-11-02 20:28:35,395 INFO L131 PetriNetUnfolder]: For 2893/2913 co-relation queries the response was YES. [2022-11-02 20:28:35,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2746 conditions, 929 events. 115/929 cut-off events. For 2893/2913 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6449 event pairs, 50 based on Foata normal form. 1/891 useless extension candidates. Maximal degree in co-relation 2667. Up to 216 conditions per place. [2022-11-02 20:28:35,402 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 65 selfloop transitions, 12 changer transitions 29/286 dead transitions. [2022-11-02 20:28:35,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 286 transitions, 1944 flow [2022-11-02 20:28:35,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:28:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 20:28:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2912 transitions. [2022-11-02 20:28:35,406 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8156862745098039 [2022-11-02 20:28:35,407 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2912 transitions. [2022-11-02 20:28:35,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2912 transitions. [2022-11-02 20:28:35,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:35,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2912 transitions. [2022-11-02 20:28:35,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 171.2941176470588) internal successors, (2912), 17 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:35,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:35,416 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:35,416 INFO L175 Difference]: Start difference. First operand has 337 places, 265 transitions, 1572 flow. Second operand 17 states and 2912 transitions. [2022-11-02 20:28:35,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 286 transitions, 1944 flow [2022-11-02 20:28:35,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 286 transitions, 1813 flow, removed 35 selfloop flow, removed 18 redundant places. [2022-11-02 20:28:35,447 INFO L231 Difference]: Finished difference. Result has 329 places, 256 transitions, 1375 flow [2022-11-02 20:28:35,447 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1375, PETRI_PLACES=329, PETRI_TRANSITIONS=256} [2022-11-02 20:28:35,448 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 142 predicate places. [2022-11-02 20:28:35,448 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 256 transitions, 1375 flow [2022-11-02 20:28:35,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:35,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:35,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:35,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:28:35,449 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:35,450 INFO L85 PathProgramCache]: Analyzing trace with hash 973233768, now seen corresponding path program 20 times [2022-11-02 20:28:35,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:35,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671821699] [2022-11-02 20:28:35,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:35,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:35,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671821699] [2022-11-02 20:28:35,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671821699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:35,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:35,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:35,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120468392] [2022-11-02 20:28:35,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:35,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:35,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:35,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:35,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:35,680 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:35,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 256 transitions, 1375 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:35,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:35,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:35,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:36,130 INFO L130 PetriNetUnfolder]: 101/821 cut-off events. [2022-11-02 20:28:36,130 INFO L131 PetriNetUnfolder]: For 2254/2274 co-relation queries the response was YES. [2022-11-02 20:28:36,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2315 conditions, 821 events. 101/821 cut-off events. For 2254/2274 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5472 event pairs, 43 based on Foata normal form. 1/784 useless extension candidates. Maximal degree in co-relation 2243. Up to 194 conditions per place. [2022-11-02 20:28:36,138 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 51 selfloop transitions, 0 changer transitions 41/266 dead transitions. [2022-11-02 20:28:36,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 266 transitions, 1596 flow [2022-11-02 20:28:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:28:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:28:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3070 transitions. [2022-11-02 20:28:36,142 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8121693121693122 [2022-11-02 20:28:36,142 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3070 transitions. [2022-11-02 20:28:36,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3070 transitions. [2022-11-02 20:28:36,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:36,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3070 transitions. [2022-11-02 20:28:36,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 170.55555555555554) internal successors, (3070), 18 states have internal predecessors, (3070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:36,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:36,152 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:36,152 INFO L175 Difference]: Start difference. First operand has 329 places, 256 transitions, 1375 flow. Second operand 18 states and 3070 transitions. [2022-11-02 20:28:36,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 266 transitions, 1596 flow [2022-11-02 20:28:36,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 266 transitions, 1512 flow, removed 18 selfloop flow, removed 18 redundant places. [2022-11-02 20:28:36,178 INFO L231 Difference]: Finished difference. Result has 315 places, 225 transitions, 1027 flow [2022-11-02 20:28:36,179 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1027, PETRI_PLACES=315, PETRI_TRANSITIONS=225} [2022-11-02 20:28:36,179 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 128 predicate places. [2022-11-02 20:28:36,180 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 225 transitions, 1027 flow [2022-11-02 20:28:36,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:36,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:36,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:36,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:28:36,181 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:36,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:36,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1762501120, now seen corresponding path program 16 times [2022-11-02 20:28:36,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:36,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868124181] [2022-11-02 20:28:36,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:36,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:36,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:36,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868124181] [2022-11-02 20:28:36,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868124181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:36,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:36,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:36,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169210561] [2022-11-02 20:28:36,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:36,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:36,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:36,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:36,411 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:36,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 225 transitions, 1027 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:36,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:36,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:36,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:36,771 INFO L130 PetriNetUnfolder]: 77/698 cut-off events. [2022-11-02 20:28:36,771 INFO L131 PetriNetUnfolder]: For 1537/1542 co-relation queries the response was YES. [2022-11-02 20:28:36,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 698 events. 77/698 cut-off events. For 1537/1542 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4243 event pairs, 32 based on Foata normal form. 1/663 useless extension candidates. Maximal degree in co-relation 1748. Up to 124 conditions per place. [2022-11-02 20:28:36,780 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 49 selfloop transitions, 10 changer transitions 33/248 dead transitions. [2022-11-02 20:28:36,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 248 transitions, 1380 flow [2022-11-02 20:28:36,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:28:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:28:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3081 transitions. [2022-11-02 20:28:36,784 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8150793650793651 [2022-11-02 20:28:36,784 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3081 transitions. [2022-11-02 20:28:36,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3081 transitions. [2022-11-02 20:28:36,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:36,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3081 transitions. [2022-11-02 20:28:36,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 171.16666666666666) internal successors, (3081), 18 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:36,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:36,793 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:36,793 INFO L175 Difference]: Start difference. First operand has 315 places, 225 transitions, 1027 flow. Second operand 18 states and 3081 transitions. [2022-11-02 20:28:36,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 248 transitions, 1380 flow [2022-11-02 20:28:36,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 248 transitions, 1346 flow, removed 17 selfloop flow, removed 11 redundant places. [2022-11-02 20:28:36,810 INFO L231 Difference]: Finished difference. Result has 285 places, 210 transitions, 846 flow [2022-11-02 20:28:36,811 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=846, PETRI_PLACES=285, PETRI_TRANSITIONS=210} [2022-11-02 20:28:36,811 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 98 predicate places. [2022-11-02 20:28:36,812 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 210 transitions, 846 flow [2022-11-02 20:28:36,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:36,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:36,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:36,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:28:36,813 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:36,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1947535390, now seen corresponding path program 17 times [2022-11-02 20:28:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:36,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812704812] [2022-11-02 20:28:36,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:37,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812704812] [2022-11-02 20:28:37,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812704812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:37,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:37,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396514339] [2022-11-02 20:28:37,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:37,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:37,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:37,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:37,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:37,040 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:37,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 210 transitions, 846 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:37,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:37,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:37,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:37,364 INFO L130 PetriNetUnfolder]: 81/701 cut-off events. [2022-11-02 20:28:37,364 INFO L131 PetriNetUnfolder]: For 1797/1800 co-relation queries the response was YES. [2022-11-02 20:28:37,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 701 events. 81/701 cut-off events. For 1797/1800 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4259 event pairs, 32 based on Foata normal form. 1/664 useless extension candidates. Maximal degree in co-relation 1799. Up to 125 conditions per place. [2022-11-02 20:28:37,373 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 46 selfloop transitions, 20 changer transitions 28/250 dead transitions. [2022-11-02 20:28:37,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 250 transitions, 1504 flow [2022-11-02 20:28:37,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:28:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 20:28:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2918 transitions. [2022-11-02 20:28:37,384 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8173669467787115 [2022-11-02 20:28:37,384 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2918 transitions. [2022-11-02 20:28:37,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2918 transitions. [2022-11-02 20:28:37,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:37,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2918 transitions. [2022-11-02 20:28:37,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 171.64705882352942) internal successors, (2918), 17 states have internal predecessors, (2918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:37,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:37,389 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:37,389 INFO L175 Difference]: Start difference. First operand has 285 places, 210 transitions, 846 flow. Second operand 17 states and 2918 transitions. [2022-11-02 20:28:37,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 250 transitions, 1504 flow [2022-11-02 20:28:37,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 250 transitions, 1364 flow, removed 26 selfloop flow, removed 16 redundant places. [2022-11-02 20:28:37,402 INFO L231 Difference]: Finished difference. Result has 272 places, 218 transitions, 981 flow [2022-11-02 20:28:37,403 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=981, PETRI_PLACES=272, PETRI_TRANSITIONS=218} [2022-11-02 20:28:37,403 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 85 predicate places. [2022-11-02 20:28:37,404 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 218 transitions, 981 flow [2022-11-02 20:28:37,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:37,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:37,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:37,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:28:37,405 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:37,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:37,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1023953030, now seen corresponding path program 18 times [2022-11-02 20:28:37,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:37,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136432726] [2022-11-02 20:28:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:37,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:37,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:37,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136432726] [2022-11-02 20:28:37,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136432726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:37,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:37,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:37,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017877565] [2022-11-02 20:28:37,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:37,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:37,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:37,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:37,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:37,608 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:37,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 218 transitions, 981 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:37,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:37,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:37,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:37,962 INFO L130 PetriNetUnfolder]: 83/727 cut-off events. [2022-11-02 20:28:37,962 INFO L131 PetriNetUnfolder]: For 1639/1642 co-relation queries the response was YES. [2022-11-02 20:28:37,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897 conditions, 727 events. 83/727 cut-off events. For 1639/1642 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4516 event pairs, 32 based on Foata normal form. 1/691 useless extension candidates. Maximal degree in co-relation 1837. Up to 126 conditions per place. [2022-11-02 20:28:37,969 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 49 selfloop transitions, 23 changer transitions 30/258 dead transitions. [2022-11-02 20:28:37,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 258 transitions, 1616 flow [2022-11-02 20:28:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:28:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 20:28:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2920 transitions. [2022-11-02 20:28:37,973 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8179271708683473 [2022-11-02 20:28:37,974 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2920 transitions. [2022-11-02 20:28:37,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2920 transitions. [2022-11-02 20:28:37,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:37,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2920 transitions. [2022-11-02 20:28:37,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 171.76470588235293) internal successors, (2920), 17 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:37,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:37,982 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:37,983 INFO L175 Difference]: Start difference. First operand has 272 places, 218 transitions, 981 flow. Second operand 17 states and 2920 transitions. [2022-11-02 20:28:37,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 258 transitions, 1616 flow [2022-11-02 20:28:37,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 258 transitions, 1510 flow, removed 31 selfloop flow, removed 9 redundant places. [2022-11-02 20:28:38,001 INFO L231 Difference]: Finished difference. Result has 281 places, 226 transitions, 1112 flow [2022-11-02 20:28:38,001 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1112, PETRI_PLACES=281, PETRI_TRANSITIONS=226} [2022-11-02 20:28:38,002 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 94 predicate places. [2022-11-02 20:28:38,002 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 226 transitions, 1112 flow [2022-11-02 20:28:38,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:38,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:38,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:38,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:28:38,004 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:38,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:38,004 INFO L85 PathProgramCache]: Analyzing trace with hash 518830502, now seen corresponding path program 19 times [2022-11-02 20:28:38,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:38,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860730938] [2022-11-02 20:28:38,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:38,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:38,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:38,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860730938] [2022-11-02 20:28:38,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860730938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:38,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:38,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:38,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174554300] [2022-11-02 20:28:38,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:38,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:38,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:38,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:38,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:38,235 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:38,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 226 transitions, 1112 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:38,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:38,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:38,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:38,627 INFO L130 PetriNetUnfolder]: 73/678 cut-off events. [2022-11-02 20:28:38,627 INFO L131 PetriNetUnfolder]: For 1382/1385 co-relation queries the response was YES. [2022-11-02 20:28:38,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 678 events. 73/678 cut-off events. For 1382/1385 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4104 event pairs, 32 based on Foata normal form. 1/642 useless extension candidates. Maximal degree in co-relation 1665. Up to 124 conditions per place. [2022-11-02 20:28:38,635 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 44 selfloop transitions, 12 changer transitions 35/247 dead transitions. [2022-11-02 20:28:38,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 247 transitions, 1437 flow [2022-11-02 20:28:38,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:28:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:28:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3083 transitions. [2022-11-02 20:28:38,638 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8156084656084656 [2022-11-02 20:28:38,638 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3083 transitions. [2022-11-02 20:28:38,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3083 transitions. [2022-11-02 20:28:38,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:38,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3083 transitions. [2022-11-02 20:28:38,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 171.27777777777777) internal successors, (3083), 18 states have internal predecessors, (3083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:38,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:38,644 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:38,644 INFO L175 Difference]: Start difference. First operand has 281 places, 226 transitions, 1112 flow. Second operand 18 states and 3083 transitions. [2022-11-02 20:28:38,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 247 transitions, 1437 flow [2022-11-02 20:28:38,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 247 transitions, 1343 flow, removed 33 selfloop flow, removed 9 redundant places. [2022-11-02 20:28:38,659 INFO L231 Difference]: Finished difference. Result has 285 places, 211 transitions, 856 flow [2022-11-02 20:28:38,659 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=856, PETRI_PLACES=285, PETRI_TRANSITIONS=211} [2022-11-02 20:28:38,660 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 98 predicate places. [2022-11-02 20:28:38,660 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 211 transitions, 856 flow [2022-11-02 20:28:38,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:38,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:38,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:38,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:28:38,661 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:38,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1142766712, now seen corresponding path program 20 times [2022-11-02 20:28:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:38,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50276902] [2022-11-02 20:28:38,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:38,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:38,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50276902] [2022-11-02 20:28:38,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50276902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:38,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:38,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:28:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506225482] [2022-11-02 20:28:38,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:38,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:28:38,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:38,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:28:38,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:38,856 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2022-11-02 20:28:38,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 211 transitions, 856 flow. Second operand has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:38,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:38,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2022-11-02 20:28:38,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:39,272 INFO L130 PetriNetUnfolder]: 61/580 cut-off events. [2022-11-02 20:28:39,273 INFO L131 PetriNetUnfolder]: For 883/886 co-relation queries the response was YES. [2022-11-02 20:28:39,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 580 events. 61/580 cut-off events. For 883/886 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3264 event pairs, 31 based on Foata normal form. 1/544 useless extension candidates. Maximal degree in co-relation 1274. Up to 102 conditions per place. [2022-11-02 20:28:39,281 INFO L137 encePairwiseOnDemand]: 197/210 looper letters, 29 selfloop transitions, 0 changer transitions 43/222 dead transitions. [2022-11-02 20:28:39,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 222 transitions, 1029 flow [2022-11-02 20:28:39,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:28:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:28:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3071 transitions. [2022-11-02 20:28:39,285 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8124338624338624 [2022-11-02 20:28:39,285 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3071 transitions. [2022-11-02 20:28:39,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3071 transitions. [2022-11-02 20:28:39,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:39,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3071 transitions. [2022-11-02 20:28:39,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 170.61111111111111) internal successors, (3071), 18 states have internal predecessors, (3071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,295 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 210.0) internal successors, (3990), 19 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,296 INFO L175 Difference]: Start difference. First operand has 285 places, 211 transitions, 856 flow. Second operand 18 states and 3071 transitions. [2022-11-02 20:28:39,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 222 transitions, 1029 flow [2022-11-02 20:28:39,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 222 transitions, 941 flow, removed 19 selfloop flow, removed 17 redundant places. [2022-11-02 20:28:39,310 INFO L231 Difference]: Finished difference. Result has 271 places, 179 transitions, 470 flow [2022-11-02 20:28:39,311 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=470, PETRI_PLACES=271, PETRI_TRANSITIONS=179} [2022-11-02 20:28:39,311 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 84 predicate places. [2022-11-02 20:28:39,312 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 179 transitions, 470 flow [2022-11-02 20:28:39,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.8) internal successors, (1698), 10 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:39,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:39,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 20:28:39,313 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:39,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:39,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1089898066, now seen corresponding path program 1 times [2022-11-02 20:28:39,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:39,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887587339] [2022-11-02 20:28:39,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:39,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:39,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:39,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887587339] [2022-11-02 20:28:39,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887587339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:39,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:39,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:28:39,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861671546] [2022-11-02 20:28:39,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:39,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:39,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:39,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:39,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:39,360 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 210 [2022-11-02 20:28:39,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 179 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:39,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 210 [2022-11-02 20:28:39,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:39,498 INFO L130 PetriNetUnfolder]: 65/696 cut-off events. [2022-11-02 20:28:39,498 INFO L131 PetriNetUnfolder]: For 802/806 co-relation queries the response was YES. [2022-11-02 20:28:39,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 696 events. 65/696 cut-off events. For 802/806 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4367 event pairs, 29 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 1283. Up to 38 conditions per place. [2022-11-02 20:28:39,504 INFO L137 encePairwiseOnDemand]: 204/210 looper letters, 15 selfloop transitions, 3 changer transitions 0/185 dead transitions. [2022-11-02 20:28:39,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 185 transitions, 521 flow [2022-11-02 20:28:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2022-11-02 20:28:39,507 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9380952380952381 [2022-11-02 20:28:39,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 591 transitions. [2022-11-02 20:28:39,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions. [2022-11-02 20:28:39,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:39,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions. [2022-11-02 20:28:39,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,510 INFO L175 Difference]: Start difference. First operand has 271 places, 179 transitions, 470 flow. Second operand 3 states and 591 transitions. [2022-11-02 20:28:39,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 185 transitions, 521 flow [2022-11-02 20:28:39,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 185 transitions, 493 flow, removed 14 selfloop flow, removed 11 redundant places. [2022-11-02 20:28:39,519 INFO L231 Difference]: Finished difference. Result has 218 places, 182 transitions, 472 flow [2022-11-02 20:28:39,520 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=218, PETRI_TRANSITIONS=182} [2022-11-02 20:28:39,520 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 31 predicate places. [2022-11-02 20:28:39,520 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 182 transitions, 472 flow [2022-11-02 20:28:39,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:39,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:39,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 20:28:39,522 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:39,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash 940309056, now seen corresponding path program 1 times [2022-11-02 20:28:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:39,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217466777] [2022-11-02 20:28:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:39,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:39,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217466777] [2022-11-02 20:28:39,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217466777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:39,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:39,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:28:39,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863473798] [2022-11-02 20:28:39,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:39,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:39,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:39,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:39,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:39,581 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 210 [2022-11-02 20:28:39,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 182 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:39,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 210 [2022-11-02 20:28:39,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:39,673 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([518] L44-30-->L44-31: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite7#1][84], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 36#L44-31true, Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,673 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,673 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,674 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,674 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,674 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([573] L50-29-->L50-30: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite14#1_5| v_~result_7~0_1) InVars {thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_5|} OutVars{~result_7~0=v_~result_7~0_1, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_5|} AuxVars[] AssignedVars[~result_7~0][128], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 106#L50-30true, 90#L44-30true, Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:39,674 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,675 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,675 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,675 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,677 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([513] L44-29-->L44-30: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork0_#t~ite7#1_5|) InVars {thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_5|} AuxVars[] AssignedVars[~result_6~0][127], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 106#L50-30true, 90#L44-30true, Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:39,677 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,678 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,678 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,678 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,679 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([513] L44-29-->L44-30: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork0_#t~ite7#1_5|) InVars {thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_5|} AuxVars[] AssignedVars[~result_6~0][127], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 106#L50-30true, 90#L44-30true, Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:39,680 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,680 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,680 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,681 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,681 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,687 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L50-28-->L50-29: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite13#1_3| |v_thread2Thread1of1ForFork1_#t~ite14#1_3|) InVars {thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|} OutVars{thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite14#1][106], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 36#L44-31true, Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,687 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,688 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,688 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,688 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,689 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([568] L50-28-->L50-29: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite13#1_3| |v_thread2Thread1of1ForFork1_#t~ite14#1_3|) InVars {thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|} OutVars{thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite14#1][106], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 36#L44-31true, Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,689 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,690 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,690 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,690 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,690 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L50-28-->L50-29: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite13#1_3| |v_thread2Thread1of1ForFork1_#t~ite14#1_3|) InVars {thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|} OutVars{thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite14#1][106], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), 161#L44-32true, Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,696 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,696 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,697 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,697 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,712 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([518] L44-30-->L44-31: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite7#1][84], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 36#L44-31true, Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,712 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is not cut-off event [2022-11-02 20:28:39,712 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-11-02 20:28:39,712 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-11-02 20:28:39,713 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-11-02 20:28:39,713 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-11-02 20:28:39,713 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([568] L50-28-->L50-29: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite13#1_3| |v_thread2Thread1of1ForFork1_#t~ite14#1_3|) InVars {thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|} OutVars{thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite14#1][106], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), 161#L44-32true, Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,713 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,714 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,714 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,714 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,714 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,715 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([573] L50-29-->L50-30: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite14#1_5| v_~result_7~0_1) InVars {thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_5|} OutVars{~result_7~0=v_~result_7~0_1, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_5|} AuxVars[] AssignedVars[~result_7~0][128], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 106#L50-30true, 90#L44-30true, Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,715 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is not cut-off event [2022-11-02 20:28:39,715 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-11-02 20:28:39,715 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-11-02 20:28:39,716 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-11-02 20:28:39,716 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-11-02 20:28:39,758 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([513] L44-29-->L44-30: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork0_#t~ite7#1_5|) InVars {thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_5|} AuxVars[] AssignedVars[~result_6~0][127], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 106#L50-30true, 90#L44-30true, Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:39,759 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,759 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,759 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,759 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,760 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,760 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,765 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([518] L44-30-->L44-31: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite7#1][84], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 36#L44-31true, Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,765 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,765 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,766 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,766 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,766 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,766 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,767 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([573] L50-29-->L50-30: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite14#1_5| v_~result_7~0_1) InVars {thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_5|} OutVars{~result_7~0=v_~result_7~0_1, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_5|} AuxVars[] AssignedVars[~result_7~0][128], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 106#L50-30true, 90#L44-30true, Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,767 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,767 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,767 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,767 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,768 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,768 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,774 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([568] L50-28-->L50-29: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite13#1_3| |v_thread2Thread1of1ForFork1_#t~ite14#1_3|) InVars {thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|} OutVars{thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite14#1][106], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 36#L44-31true, Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,774 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,774 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,775 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,775 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,775 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,775 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,780 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([568] L50-28-->L50-29: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite13#1_3| |v_thread2Thread1of1ForFork1_#t~ite14#1_3|) InVars {thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|} OutVars{thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite14#1][106], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), 161#L44-32true, Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,780 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-02 20:28:39,781 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,781 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,781 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,781 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,781 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,792 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([568] L50-28-->L50-29: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite13#1_3| |v_thread2Thread1of1ForFork1_#t~ite14#1_3|) InVars {thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|} OutVars{thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite14#1][106], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 36#L44-31true, 52#L50-29true, Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,793 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,793 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,793 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,793 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,794 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,794 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,794 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,794 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([568] L50-28-->L50-29: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite13#1_3| |v_thread2Thread1of1ForFork1_#t~ite14#1_3|) InVars {thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|} OutVars{thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite14#1][106], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), 161#L44-32true, Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,795 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-02 20:28:39,795 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,795 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,795 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:28:39,796 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,796 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,796 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,797 INFO L381 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([568] L50-28-->L50-29: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite13#1_3| |v_thread2Thread1of1ForFork1_#t~ite14#1_3|) InVars {thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|} OutVars{thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite14#1][106], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 36#L44-31true, Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,798 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,798 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,798 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,798 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,798 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,799 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,799 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,799 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,799 INFO L381 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([568] L50-28-->L50-29: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite13#1_3| |v_thread2Thread1of1ForFork1_#t~ite14#1_3|) InVars {thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|} OutVars{thread2Thread1of1ForFork1_#t~ite13#1=|v_thread2Thread1of1ForFork1_#t~ite13#1_3|, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite14#1][106], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), 161#L44-32true, Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,800 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-02 20:28:39,800 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,800 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:28:39,800 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,800 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:28:39,801 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,801 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,801 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:39,803 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([518] L44-30-->L44-31: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite7#1][84], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 36#L44-31true, 52#L50-29true, Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,804 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,804 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,804 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,804 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,805 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,805 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,805 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,805 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([573] L50-29-->L50-30: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite14#1_5| v_~result_7~0_1) InVars {thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_5|} OutVars{~result_7~0=v_~result_7~0_1, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_5|} AuxVars[] AssignedVars[~result_7~0][128], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 106#L50-30true, 90#L44-30true, Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,806 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,806 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,806 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,806 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,806 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,807 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,807 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,811 INFO L381 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([518] L44-30-->L44-31: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite7#1][84], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 36#L44-31true, Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,811 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,811 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,811 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,812 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,812 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,812 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,812 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,812 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,813 INFO L381 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([573] L50-29-->L50-30: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite14#1_5| v_~result_7~0_1) InVars {thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_5|} OutVars{~result_7~0=v_~result_7~0_1, thread2Thread1of1ForFork1_#t~ite14#1=|v_thread2Thread1of1ForFork1_#t~ite14#1_5|} AuxVars[] AssignedVars[~result_7~0][128], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 106#L50-30true, 90#L44-30true, Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,813 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,813 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,813 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,814 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,814 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,814 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,814 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,814 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,817 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([513] L44-29-->L44-30: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork0_#t~ite7#1_5|) InVars {thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_5|} AuxVars[] AssignedVars[~result_6~0][127], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 106#L50-30true, 90#L44-30true, Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:39,818 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,818 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,818 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,818 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,819 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,819 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,819 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,820 INFO L381 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([513] L44-29-->L44-30: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork0_#t~ite7#1_5|) InVars {thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork0_#t~ite7#1=|v_thread1Thread1of1ForFork0_#t~ite7#1_5|} AuxVars[] AssignedVars[~result_6~0][127], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 106#L50-30true, 90#L44-30true, Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:39,820 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,820 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,821 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,821 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,821 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,821 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,821 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:28:39,822 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:39,823 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] thread1EXIT-->L68-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_5|} AuxVars[] AssignedVars[][132], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 50#L68-2true, Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 13#L50-13true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0))]) [2022-11-02 20:28:39,823 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-02 20:28:39,823 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:28:39,824 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:28:39,824 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:28:39,864 INFO L130 PetriNetUnfolder]: 137/1312 cut-off events. [2022-11-02 20:28:39,865 INFO L131 PetriNetUnfolder]: For 1165/1177 co-relation queries the response was YES. [2022-11-02 20:28:39,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2429 conditions, 1312 events. 137/1312 cut-off events. For 1165/1177 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9733 event pairs, 57 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 2385. Up to 101 conditions per place. [2022-11-02 20:28:39,879 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 13 selfloop transitions, 5 changer transitions 0/188 dead transitions. [2022-11-02 20:28:39,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 188 transitions, 523 flow [2022-11-02 20:28:39,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2022-11-02 20:28:39,881 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9380952380952381 [2022-11-02 20:28:39,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 591 transitions. [2022-11-02 20:28:39,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions. [2022-11-02 20:28:39,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:39,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions. [2022-11-02 20:28:39,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,884 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,885 INFO L175 Difference]: Start difference. First operand has 218 places, 182 transitions, 472 flow. Second operand 3 states and 591 transitions. [2022-11-02 20:28:39,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 188 transitions, 523 flow [2022-11-02 20:28:39,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 188 transitions, 520 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:28:39,897 INFO L231 Difference]: Finished difference. Result has 221 places, 185 transitions, 507 flow [2022-11-02 20:28:39,898 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=507, PETRI_PLACES=221, PETRI_TRANSITIONS=185} [2022-11-02 20:28:39,898 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 34 predicate places. [2022-11-02 20:28:39,898 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 185 transitions, 507 flow [2022-11-02 20:28:39,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:39,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:39,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 20:28:39,900 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:39,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:39,900 INFO L85 PathProgramCache]: Analyzing trace with hash -438261318, now seen corresponding path program 1 times [2022-11-02 20:28:39,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:39,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552520558] [2022-11-02 20:28:39,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:39,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:40,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:40,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552520558] [2022-11-02 20:28:40,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552520558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:40,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:40,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:28:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483622446] [2022-11-02 20:28:40,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:40,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:28:40,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:40,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:28:40,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:28:40,243 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:28:40,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 185 transitions, 507 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:40,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:40,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:28:40,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:41,981 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L44-17-->L44-26: Formula: (= (+ 1 |v_thread1Thread1of1ForFork0_#t~ite4#1_1|) 0) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite4#1][53], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 87#L44-26true, Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), 2220#(<= (+ |thread1Thread1of1ForFork0_#t~ite4#1| 1) 0), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 99#L50-27true, Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 2212#true, Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:41,982 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:28:41,982 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 20:28:41,982 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 20:28:41,983 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 20:28:41,988 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L44-17-->L44-26: Formula: (= (+ 1 |v_thread1Thread1of1ForFork0_#t~ite4#1_1|) 0) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite4#1][53], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 84#L50-28true, Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 87#L44-26true, Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), 2220#(<= (+ |thread1Thread1of1ForFork0_#t~ite4#1| 1) 0), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 2212#true, Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:41,988 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-02 20:28:41,988 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 20:28:41,988 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 20:28:41,988 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 20:28:41,993 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L44-17-->L44-26: Formula: (= (+ 1 |v_thread1Thread1of1ForFork0_#t~ite4#1_1|) 0) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite4#1][53], [Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 87#L44-26true, Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), 2220#(<= (+ |thread1Thread1of1ForFork0_#t~ite4#1| 1) 0), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 2206#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 2212#true, Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 52#L50-29true, Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:41,993 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-02 20:28:41,993 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 20:28:41,993 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 20:28:41,993 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 20:28:41,998 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L44-17-->L44-26: Formula: (= (+ 1 |v_thread1Thread1of1ForFork0_#t~ite4#1_1|) 0) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite4#1][53], [Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), Black: 2206#true, Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 2212#true, Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 229#(= ~result_6~0 0), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), 87#L44-26true, Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 106#L50-30true, Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), 2220#(<= (+ |thread1Thread1of1ForFork0_#t~ite4#1| 1) 0), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:41,998 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-11-02 20:28:41,998 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-11-02 20:28:41,999 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-11-02 20:28:41,999 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-11-02 20:28:42,004 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L44-17-->L44-26: Formula: (= (+ 1 |v_thread1Thread1of1ForFork0_#t~ite4#1_1|) 0) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite4#1][53], [Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), Black: 2206#true, Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 2212#true, Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 229#(= ~result_6~0 0), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), 166#L50-31true, Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 87#L44-26true, Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), 2220#(<= (+ |thread1Thread1of1ForFork0_#t~ite4#1| 1) 0), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:42,004 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-11-02 20:28:42,004 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:28:42,005 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:28:42,005 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:28:42,015 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L44-17-->L44-26: Formula: (= (+ 1 |v_thread1Thread1of1ForFork0_#t~ite4#1_1|) 0) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite4#1][53], [Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), Black: 2206#true, Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 2212#true, Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 4#L50-33true, 2168#true, Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 229#(= ~result_6~0 0), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 87#L44-26true, Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), 2220#(<= (+ |thread1Thread1of1ForFork0_#t~ite4#1| 1) 0), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:42,016 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-11-02 20:28:42,016 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:28:42,016 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:28:42,016 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:28:42,028 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L44-17-->L44-26: Formula: (= (+ 1 |v_thread1Thread1of1ForFork0_#t~ite4#1_1|) 0) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite4#1][53], [Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), Black: 2206#true, Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 2212#true, Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 229#(= ~result_6~0 0), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 87#L44-26true, Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), 2220#(<= (+ |thread1Thread1of1ForFork0_#t~ite4#1| 1) 0), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, 127#L50-34true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:42,029 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:28:42,029 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:42,029 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:42,029 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:28:42,033 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L44-17-->L44-26: Formula: (= (+ 1 |v_thread1Thread1of1ForFork0_#t~ite4#1_1|) 0) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite4#1][53], [Black: 248#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 250#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0)), Black: 252#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0) (= |thread2Thread1of1ForFork1_#t~ite14#1| 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 0)), Black: 246#(and (= ~result_6~0 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 0) (= ~result_7~0 0)), Black: 232#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 491#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0)), Black: 2206#true, Black: 398#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 80#L50-35true, Black: 1147#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1)), Black: 2212#true, Black: 771#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1535#(and (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1543#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2168#true, Black: 1052#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 288#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 292#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 2208#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 304#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 286#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 229#(= ~result_6~0 0), Black: 1842#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 2101#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 300#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1) (not (<= 0 ~result_7~0))), Black: 1844#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 2214#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 2111#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1)), Black: 1331#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), 87#L44-26true, Black: 2099#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 213#true, Black: 439#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0)), 2220#(<= (+ |thread1Thread1of1ForFork0_#t~ite4#1| 1) 0), Black: 823#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 825#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= ~result_6~0 1) (= |thread1Thread1of1ForFork0_#t~ite7#1| 1) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 219#true, Black: 1603#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (= ~result_7~0 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 727#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 350#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1)), 1963#true, Black: 1742#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 1880#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 614#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), 129#L67-4true, Black: 1882#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite14#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (<= (+ ~result_7~0 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1)), Black: 360#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 356#(and (= |thread2Thread1of1ForFork1_#t~ite14#1| 1) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite7#1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite8#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~ite6#1| 1) 0)), Black: 1872#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite13#1| 1) 0) (= |thread1Thread1of1ForFork0_#t~ite1#1| 1))]) [2022-11-02 20:28:42,034 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-02 20:28:42,034 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:42,034 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:42,034 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:28:42,159 INFO L130 PetriNetUnfolder]: 712/2579 cut-off events. [2022-11-02 20:28:42,159 INFO L131 PetriNetUnfolder]: For 2484/2484 co-relation queries the response was YES. [2022-11-02 20:28:42,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6002 conditions, 2579 events. 712/2579 cut-off events. For 2484/2484 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 20655 event pairs, 365 based on Foata normal form. 1/2455 useless extension candidates. Maximal degree in co-relation 5957. Up to 1178 conditions per place. [2022-11-02 20:28:42,181 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 153 selfloop transitions, 10 changer transitions 99/405 dead transitions. [2022-11-02 20:28:42,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 405 transitions, 1875 flow [2022-11-02 20:28:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-02 20:28:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-11-02 20:28:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 9250 transitions. [2022-11-02 20:28:42,189 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7594417077175698 [2022-11-02 20:28:42,190 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 9250 transitions. [2022-11-02 20:28:42,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 9250 transitions. [2022-11-02 20:28:42,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:42,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 9250 transitions. [2022-11-02 20:28:42,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 159.48275862068965) internal successors, (9250), 58 states have internal predecessors, (9250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:42,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 210.0) internal successors, (12390), 59 states have internal predecessors, (12390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:42,219 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 210.0) internal successors, (12390), 59 states have internal predecessors, (12390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:42,220 INFO L175 Difference]: Start difference. First operand has 221 places, 185 transitions, 507 flow. Second operand 58 states and 9250 transitions. [2022-11-02 20:28:42,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 405 transitions, 1875 flow [2022-11-02 20:28:42,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 405 transitions, 1865 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:42,237 INFO L231 Difference]: Finished difference. Result has 332 places, 194 transitions, 755 flow [2022-11-02 20:28:42,237 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=755, PETRI_PLACES=332, PETRI_TRANSITIONS=194} [2022-11-02 20:28:42,238 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 145 predicate places. [2022-11-02 20:28:42,238 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 194 transitions, 755 flow [2022-11-02 20:28:42,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:42,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:42,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:42,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 20:28:42,240 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:42,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:42,240 INFO L85 PathProgramCache]: Analyzing trace with hash -682410142, now seen corresponding path program 1 times [2022-11-02 20:28:42,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:42,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504791029] [2022-11-02 20:28:42,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:42,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:42,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:42,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504791029] [2022-11-02 20:28:42,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504791029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:42,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:42,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:28:42,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285717247] [2022-11-02 20:28:42,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:42,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:42,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:42,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:42,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:42,282 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 210 [2022-11-02 20:28:42,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 194 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:42,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:42,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 210 [2022-11-02 20:28:42,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:42,734 INFO L130 PetriNetUnfolder]: 217/1533 cut-off events. [2022-11-02 20:28:42,735 INFO L131 PetriNetUnfolder]: For 17601/17676 co-relation queries the response was YES. [2022-11-02 20:28:42,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6508 conditions, 1533 events. 217/1533 cut-off events. For 17601/17676 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 10951 event pairs, 176 based on Foata normal form. 19/1476 useless extension candidates. Maximal degree in co-relation 6407. Up to 109 conditions per place. [2022-11-02 20:28:42,768 INFO L137 encePairwiseOnDemand]: 204/210 looper letters, 18 selfloop transitions, 3 changer transitions 0/200 dead transitions. [2022-11-02 20:28:42,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 200 transitions, 818 flow [2022-11-02 20:28:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2022-11-02 20:28:42,770 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9380952380952381 [2022-11-02 20:28:42,771 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 591 transitions. [2022-11-02 20:28:42,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions. [2022-11-02 20:28:42,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:42,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions. [2022-11-02 20:28:42,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:42,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:42,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:42,776 INFO L175 Difference]: Start difference. First operand has 332 places, 194 transitions, 755 flow. Second operand 3 states and 591 transitions. [2022-11-02 20:28:42,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 200 transitions, 818 flow [2022-11-02 20:28:42,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 200 transitions, 767 flow, removed 25 selfloop flow, removed 21 redundant places. [2022-11-02 20:28:42,839 INFO L231 Difference]: Finished difference. Result has 268 places, 197 transitions, 740 flow [2022-11-02 20:28:42,839 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=268, PETRI_TRANSITIONS=197} [2022-11-02 20:28:42,840 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 81 predicate places. [2022-11-02 20:28:42,840 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 197 transitions, 740 flow [2022-11-02 20:28:42,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:42,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:42,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:42,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-02 20:28:42,841 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:42,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1120566574, now seen corresponding path program 2 times [2022-11-02 20:28:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:42,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370501443] [2022-11-02 20:28:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:42,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370501443] [2022-11-02 20:28:42,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370501443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:42,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:42,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:28:42,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996486482] [2022-11-02 20:28:42,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:42,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:42,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:42,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:42,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:42,880 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 210 [2022-11-02 20:28:42,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 197 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:42,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:42,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 210 [2022-11-02 20:28:42,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:43,148 INFO L130 PetriNetUnfolder]: 143/1221 cut-off events. [2022-11-02 20:28:43,148 INFO L131 PetriNetUnfolder]: For 7369/7416 co-relation queries the response was YES. [2022-11-02 20:28:43,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4258 conditions, 1221 events. 143/1221 cut-off events. For 7369/7416 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8388 event pairs, 127 based on Foata normal form. 10/1189 useless extension candidates. Maximal degree in co-relation 4176. Up to 83 conditions per place. [2022-11-02 20:28:43,171 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 16 selfloop transitions, 5 changer transitions 2/203 dead transitions. [2022-11-02 20:28:43,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 203 transitions, 803 flow [2022-11-02 20:28:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2022-11-02 20:28:43,173 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9380952380952381 [2022-11-02 20:28:43,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 591 transitions. [2022-11-02 20:28:43,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions. [2022-11-02 20:28:43,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:43,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions. [2022-11-02 20:28:43,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:43,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:43,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:43,176 INFO L175 Difference]: Start difference. First operand has 268 places, 197 transitions, 740 flow. Second operand 3 states and 591 transitions. [2022-11-02 20:28:43,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 203 transitions, 803 flow [2022-11-02 20:28:43,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 203 transitions, 794 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-02 20:28:43,209 INFO L231 Difference]: Finished difference. Result has 271 places, 198 transitions, 771 flow [2022-11-02 20:28:43,210 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=271, PETRI_TRANSITIONS=198} [2022-11-02 20:28:43,210 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 84 predicate places. [2022-11-02 20:28:43,210 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 198 transitions, 771 flow [2022-11-02 20:28:43,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:43,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:43,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:43,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-02 20:28:43,212 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1366487296, now seen corresponding path program 1 times [2022-11-02 20:28:43,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:43,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735177389] [2022-11-02 20:28:43,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:43,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:43,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:43,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735177389] [2022-11-02 20:28:43,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735177389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:43,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:43,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:28:43,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891192512] [2022-11-02 20:28:43,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:43,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:28:43,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:43,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:28:43,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:28:43,538 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:28:43,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 198 transitions, 771 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:43,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:43,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:28:43,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:45,449 INFO L130 PetriNetUnfolder]: 478/2017 cut-off events. [2022-11-02 20:28:45,449 INFO L131 PetriNetUnfolder]: For 13645/13686 co-relation queries the response was YES. [2022-11-02 20:28:45,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8138 conditions, 2017 events. 478/2017 cut-off events. For 13645/13686 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 14865 event pairs, 300 based on Foata normal form. 15/1983 useless extension candidates. Maximal degree in co-relation 8055. Up to 806 conditions per place. [2022-11-02 20:28:45,488 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 143 selfloop transitions, 10 changer transitions 103/404 dead transitions. [2022-11-02 20:28:45,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 404 transitions, 3063 flow [2022-11-02 20:28:45,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-02 20:28:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-11-02 20:28:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 9236 transitions. [2022-11-02 20:28:45,498 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7582922824302135 [2022-11-02 20:28:45,498 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 9236 transitions. [2022-11-02 20:28:45,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 9236 transitions. [2022-11-02 20:28:45,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:45,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 9236 transitions. [2022-11-02 20:28:45,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 159.24137931034483) internal successors, (9236), 58 states have internal predecessors, (9236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:45,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 210.0) internal successors, (12390), 59 states have internal predecessors, (12390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:45,529 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 210.0) internal successors, (12390), 59 states have internal predecessors, (12390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:45,530 INFO L175 Difference]: Start difference. First operand has 271 places, 198 transitions, 771 flow. Second operand 58 states and 9236 transitions. [2022-11-02 20:28:45,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 404 transitions, 3063 flow [2022-11-02 20:28:45,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 404 transitions, 3047 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:45,593 INFO L231 Difference]: Finished difference. Result has 380 places, 207 transitions, 1065 flow [2022-11-02 20:28:45,594 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=1065, PETRI_PLACES=380, PETRI_TRANSITIONS=207} [2022-11-02 20:28:45,595 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 193 predicate places. [2022-11-02 20:28:45,595 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 207 transitions, 1065 flow [2022-11-02 20:28:45,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:45,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:45,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:45,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-02 20:28:45,596 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:45,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1296219468, now seen corresponding path program 1 times [2022-11-02 20:28:45,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:45,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170222229] [2022-11-02 20:28:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:45,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:45,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170222229] [2022-11-02 20:28:45,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170222229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:45,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:45,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:28:45,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404456015] [2022-11-02 20:28:45,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:45,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:28:45,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:45,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:28:45,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:28:45,904 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:28:45,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 207 transitions, 1065 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:45,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:45,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:28:45,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:47,591 INFO L130 PetriNetUnfolder]: 527/2177 cut-off events. [2022-11-02 20:28:47,591 INFO L131 PetriNetUnfolder]: For 50195/50264 co-relation queries the response was YES. [2022-11-02 20:28:47,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13694 conditions, 2177 events. 527/2177 cut-off events. For 50195/50264 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16167 event pairs, 317 based on Foata normal form. 16/2132 useless extension candidates. Maximal degree in co-relation 13555. Up to 825 conditions per place. [2022-11-02 20:28:47,628 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 126 selfloop transitions, 23 changer transitions 78/375 dead transitions. [2022-11-02 20:28:47,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 375 transitions, 4926 flow [2022-11-02 20:28:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-02 20:28:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-11-02 20:28:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 6715 transitions. [2022-11-02 20:28:47,635 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7613378684807256 [2022-11-02 20:28:47,635 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 6715 transitions. [2022-11-02 20:28:47,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 6715 transitions. [2022-11-02 20:28:47,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:47,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 6715 transitions. [2022-11-02 20:28:47,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 159.88095238095238) internal successors, (6715), 42 states have internal predecessors, (6715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:47,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 210.0) internal successors, (9030), 43 states have internal predecessors, (9030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:47,648 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 210.0) internal successors, (9030), 43 states have internal predecessors, (9030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:47,648 INFO L175 Difference]: Start difference. First operand has 380 places, 207 transitions, 1065 flow. Second operand 42 states and 6715 transitions. [2022-11-02 20:28:47,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 375 transitions, 4926 flow [2022-11-02 20:28:47,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 375 transitions, 3709 flow, removed 608 selfloop flow, removed 34 redundant places. [2022-11-02 20:28:47,792 INFO L231 Difference]: Finished difference. Result has 379 places, 229 transitions, 1429 flow [2022-11-02 20:28:47,793 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=1429, PETRI_PLACES=379, PETRI_TRANSITIONS=229} [2022-11-02 20:28:47,793 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 192 predicate places. [2022-11-02 20:28:47,793 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 229 transitions, 1429 flow [2022-11-02 20:28:47,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:47,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:47,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:47,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-02 20:28:47,795 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:47,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:47,795 INFO L85 PathProgramCache]: Analyzing trace with hash -913415538, now seen corresponding path program 2 times [2022-11-02 20:28:47,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:47,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155657424] [2022-11-02 20:28:47,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:47,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:48,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:48,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155657424] [2022-11-02 20:28:48,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155657424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:48,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:48,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:28:48,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403515433] [2022-11-02 20:28:48,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:48,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:28:48,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:48,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:28:48,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:28:48,129 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:28:48,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 229 transitions, 1429 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:48,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:48,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:28:48,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:50,400 INFO L130 PetriNetUnfolder]: 605/2388 cut-off events. [2022-11-02 20:28:50,401 INFO L131 PetriNetUnfolder]: For 53461/53542 co-relation queries the response was YES. [2022-11-02 20:28:50,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15072 conditions, 2388 events. 605/2388 cut-off events. For 53461/53542 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 18396 event pairs, 394 based on Foata normal form. 19/2343 useless extension candidates. Maximal degree in co-relation 14927. Up to 957 conditions per place. [2022-11-02 20:28:50,469 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 153 selfloop transitions, 21 changer transitions 85/409 dead transitions. [2022-11-02 20:28:50,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 409 transitions, 4665 flow [2022-11-02 20:28:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-02 20:28:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-11-02 20:28:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 7969 transitions. [2022-11-02 20:28:50,483 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7589523809523809 [2022-11-02 20:28:50,483 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 7969 transitions. [2022-11-02 20:28:50,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 7969 transitions. [2022-11-02 20:28:50,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:50,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 7969 transitions. [2022-11-02 20:28:50,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 159.38) internal successors, (7969), 50 states have internal predecessors, (7969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:50,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 210.0) internal successors, (10710), 51 states have internal predecessors, (10710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:50,511 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 210.0) internal successors, (10710), 51 states have internal predecessors, (10710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:50,511 INFO L175 Difference]: Start difference. First operand has 379 places, 229 transitions, 1429 flow. Second operand 50 states and 7969 transitions. [2022-11-02 20:28:50,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 409 transitions, 4665 flow [2022-11-02 20:28:50,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 409 transitions, 3789 flow, removed 438 selfloop flow, removed 29 redundant places. [2022-11-02 20:28:50,712 INFO L231 Difference]: Finished difference. Result has 417 places, 249 transitions, 1593 flow [2022-11-02 20:28:50,713 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=1593, PETRI_PLACES=417, PETRI_TRANSITIONS=249} [2022-11-02 20:28:50,713 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 230 predicate places. [2022-11-02 20:28:50,713 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 249 transitions, 1593 flow [2022-11-02 20:28:50,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:50,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:50,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:50,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-02 20:28:50,714 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash 701847890, now seen corresponding path program 3 times [2022-11-02 20:28:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:50,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767615778] [2022-11-02 20:28:50,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:50,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:51,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:51,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767615778] [2022-11-02 20:28:51,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767615778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:51,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:51,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:28:51,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292752232] [2022-11-02 20:28:51,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:51,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:28:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:51,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:28:51,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:28:51,054 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:28:51,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 249 transitions, 1593 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:51,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:51,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:28:51,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:52,678 INFO L130 PetriNetUnfolder]: 596/2324 cut-off events. [2022-11-02 20:28:52,678 INFO L131 PetriNetUnfolder]: For 54116/54198 co-relation queries the response was YES. [2022-11-02 20:28:52,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15588 conditions, 2324 events. 596/2324 cut-off events. For 54116/54198 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 17732 event pairs, 362 based on Foata normal form. 18/2276 useless extension candidates. Maximal degree in co-relation 15424. Up to 1007 conditions per place. [2022-11-02 20:28:52,787 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 130 selfloop transitions, 34 changer transitions 39/353 dead transitions. [2022-11-02 20:28:52,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 353 transitions, 4093 flow [2022-11-02 20:28:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:28:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-02 20:28:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4178 transitions. [2022-11-02 20:28:52,793 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7652014652014651 [2022-11-02 20:28:52,793 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4178 transitions. [2022-11-02 20:28:52,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4178 transitions. [2022-11-02 20:28:52,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:52,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4178 transitions. [2022-11-02 20:28:52,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 160.69230769230768) internal successors, (4178), 26 states have internal predecessors, (4178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:52,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 210.0) internal successors, (5670), 27 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:52,805 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 210.0) internal successors, (5670), 27 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:52,806 INFO L175 Difference]: Start difference. First operand has 417 places, 249 transitions, 1593 flow. Second operand 26 states and 4178 transitions. [2022-11-02 20:28:52,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 353 transitions, 4093 flow [2022-11-02 20:28:53,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 353 transitions, 3565 flow, removed 264 selfloop flow, removed 18 redundant places. [2022-11-02 20:28:53,047 INFO L231 Difference]: Finished difference. Result has 403 places, 267 transitions, 1972 flow [2022-11-02 20:28:53,048 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1972, PETRI_PLACES=403, PETRI_TRANSITIONS=267} [2022-11-02 20:28:53,048 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 216 predicate places. [2022-11-02 20:28:53,049 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 267 transitions, 1972 flow [2022-11-02 20:28:53,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:53,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:53,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:53,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-02 20:28:53,050 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:53,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:53,051 INFO L85 PathProgramCache]: Analyzing trace with hash 649414956, now seen corresponding path program 4 times [2022-11-02 20:28:53,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:53,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896242544] [2022-11-02 20:28:53,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:53,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:53,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:53,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896242544] [2022-11-02 20:28:53,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896242544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:53,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:53,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:28:53,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962819282] [2022-11-02 20:28:53,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:53,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:28:53,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:53,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:28:53,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:28:53,468 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:28:53,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 267 transitions, 1972 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:53,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:53,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:28:53,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:56,257 INFO L130 PetriNetUnfolder]: 693/2619 cut-off events. [2022-11-02 20:28:56,257 INFO L131 PetriNetUnfolder]: For 61648/61739 co-relation queries the response was YES. [2022-11-02 20:28:56,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17984 conditions, 2619 events. 693/2619 cut-off events. For 61648/61739 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 20661 event pairs, 381 based on Foata normal form. 21/2576 useless extension candidates. Maximal degree in co-relation 17820. Up to 1009 conditions per place. [2022-11-02 20:28:56,313 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 182 selfloop transitions, 30 changer transitions 84/446 dead transitions. [2022-11-02 20:28:56,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 446 transitions, 6193 flow [2022-11-02 20:28:56,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-02 20:28:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-11-02 20:28:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 8439 transitions. [2022-11-02 20:28:56,393 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7582210242587601 [2022-11-02 20:28:56,393 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 8439 transitions. [2022-11-02 20:28:56,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 8439 transitions. [2022-11-02 20:28:56,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:56,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 8439 transitions. [2022-11-02 20:28:56,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 159.22641509433961) internal successors, (8439), 53 states have internal predecessors, (8439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:56,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 210.0) internal successors, (11340), 54 states have internal predecessors, (11340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:56,410 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 210.0) internal successors, (11340), 54 states have internal predecessors, (11340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:56,411 INFO L175 Difference]: Start difference. First operand has 403 places, 267 transitions, 1972 flow. Second operand 53 states and 8439 transitions. [2022-11-02 20:28:56,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 446 transitions, 6193 flow [2022-11-02 20:28:56,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 446 transitions, 5658 flow, removed 215 selfloop flow, removed 12 redundant places. [2022-11-02 20:28:56,681 INFO L231 Difference]: Finished difference. Result has 474 places, 286 transitions, 2081 flow [2022-11-02 20:28:56,681 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=2081, PETRI_PLACES=474, PETRI_TRANSITIONS=286} [2022-11-02 20:28:56,682 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 287 predicate places. [2022-11-02 20:28:56,682 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 286 transitions, 2081 flow [2022-11-02 20:28:56,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:56,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:56,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:56,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-02 20:28:56,684 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:28:56,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:56,684 INFO L85 PathProgramCache]: Analyzing trace with hash -657336176, now seen corresponding path program 2 times [2022-11-02 20:28:56,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:56,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138204213] [2022-11-02 20:28:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:56,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:57,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:57,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138204213] [2022-11-02 20:28:57,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138204213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:57,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:57,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:28:57,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109129942] [2022-11-02 20:28:57,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:57,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:28:57,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:57,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:28:57,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:28:57,029 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:28:57,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 286 transitions, 2081 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:57,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:57,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:28:57,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:59,814 INFO L130 PetriNetUnfolder]: 763/2806 cut-off events. [2022-11-02 20:28:59,814 INFO L131 PetriNetUnfolder]: For 105129/105177 co-relation queries the response was YES. [2022-11-02 20:28:59,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22037 conditions, 2806 events. 763/2806 cut-off events. For 105129/105177 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 22275 event pairs, 488 based on Foata normal form. 23/2761 useless extension candidates. Maximal degree in co-relation 21839. Up to 1266 conditions per place. [2022-11-02 20:28:59,863 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 177 selfloop transitions, 23 changer transitions 75/450 dead transitions. [2022-11-02 20:28:59,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 450 transitions, 6238 flow [2022-11-02 20:28:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-02 20:28:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-11-02 20:28:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 6711 transitions. [2022-11-02 20:28:59,868 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7608843537414965 [2022-11-02 20:28:59,868 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 6711 transitions. [2022-11-02 20:28:59,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 6711 transitions. [2022-11-02 20:28:59,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:59,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 6711 transitions. [2022-11-02 20:28:59,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 159.78571428571428) internal successors, (6711), 42 states have internal predecessors, (6711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:59,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 210.0) internal successors, (9030), 43 states have internal predecessors, (9030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:59,881 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 210.0) internal successors, (9030), 43 states have internal predecessors, (9030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:59,881 INFO L175 Difference]: Start difference. First operand has 474 places, 286 transitions, 2081 flow. Second operand 42 states and 6711 transitions. [2022-11-02 20:28:59,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 450 transitions, 6238 flow [2022-11-02 20:29:00,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 450 transitions, 5292 flow, removed 473 selfloop flow, removed 34 redundant places. [2022-11-02 20:29:00,366 INFO L231 Difference]: Finished difference. Result has 479 places, 308 transitions, 2530 flow [2022-11-02 20:29:00,366 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=2530, PETRI_PLACES=479, PETRI_TRANSITIONS=308} [2022-11-02 20:29:00,367 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 292 predicate places. [2022-11-02 20:29:00,367 INFO L495 AbstractCegarLoop]: Abstraction has has 479 places, 308 transitions, 2530 flow [2022-11-02 20:29:00,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:00,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:00,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:00,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-02 20:29:00,368 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1627962118, now seen corresponding path program 2 times [2022-11-02 20:29:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:00,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699281239] [2022-11-02 20:29:00,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:00,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699281239] [2022-11-02 20:29:00,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699281239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:00,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:00,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:00,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156978659] [2022-11-02 20:29:00,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:00,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:00,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:00,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:00,763 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:00,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 308 transitions, 2530 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:00,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:00,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:00,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:03,609 INFO L130 PetriNetUnfolder]: 883/3092 cut-off events. [2022-11-02 20:29:03,609 INFO L131 PetriNetUnfolder]: For 117727/117819 co-relation queries the response was YES. [2022-11-02 20:29:03,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25389 conditions, 3092 events. 883/3092 cut-off events. For 117727/117819 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 24843 event pairs, 488 based on Foata normal form. 15/3038 useless extension candidates. Maximal degree in co-relation 25185. Up to 1287 conditions per place. [2022-11-02 20:29:03,855 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 231 selfloop transitions, 27 changer transitions 79/489 dead transitions. [2022-11-02 20:29:03,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 489 transitions, 7301 flow [2022-11-02 20:29:03,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-02 20:29:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-11-02 20:29:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6884 transitions. [2022-11-02 20:29:03,862 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7623477297895902 [2022-11-02 20:29:03,863 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 6884 transitions. [2022-11-02 20:29:03,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 6884 transitions. [2022-11-02 20:29:03,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:03,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 6884 transitions. [2022-11-02 20:29:03,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 160.09302325581396) internal successors, (6884), 43 states have internal predecessors, (6884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:03,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 210.0) internal successors, (9240), 44 states have internal predecessors, (9240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:03,878 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 210.0) internal successors, (9240), 44 states have internal predecessors, (9240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:03,878 INFO L175 Difference]: Start difference. First operand has 479 places, 308 transitions, 2530 flow. Second operand 43 states and 6884 transitions. [2022-11-02 20:29:03,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 489 transitions, 7301 flow [2022-11-02 20:29:04,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 489 transitions, 6491 flow, removed 405 selfloop flow, removed 24 redundant places. [2022-11-02 20:29:04,457 INFO L231 Difference]: Finished difference. Result has 505 places, 332 transitions, 2813 flow [2022-11-02 20:29:04,457 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=2813, PETRI_PLACES=505, PETRI_TRANSITIONS=332} [2022-11-02 20:29:04,458 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 318 predicate places. [2022-11-02 20:29:04,458 INFO L495 AbstractCegarLoop]: Abstraction has has 505 places, 332 transitions, 2813 flow [2022-11-02 20:29:04,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:04,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:04,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:04,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-02 20:29:04,459 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:04,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1338790134, now seen corresponding path program 5 times [2022-11-02 20:29:04,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:04,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007363594] [2022-11-02 20:29:04,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:04,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:04,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:04,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007363594] [2022-11-02 20:29:04,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007363594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:04,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:04,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:04,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118189147] [2022-11-02 20:29:04,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:04,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:04,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:04,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:04,788 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:04,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 332 transitions, 2813 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:04,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:04,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:04,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:08,084 INFO L130 PetriNetUnfolder]: 958/3258 cut-off events. [2022-11-02 20:29:08,085 INFO L131 PetriNetUnfolder]: For 156205/156307 co-relation queries the response was YES. [2022-11-02 20:29:08,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29010 conditions, 3258 events. 958/3258 cut-off events. For 156205/156307 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 26627 event pairs, 579 based on Foata normal form. 16/3202 useless extension candidates. Maximal degree in co-relation 28792. Up to 1399 conditions per place. [2022-11-02 20:29:08,171 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 232 selfloop transitions, 36 changer transitions 85/511 dead transitions. [2022-11-02 20:29:08,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 511 transitions, 8207 flow [2022-11-02 20:29:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-02 20:29:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-11-02 20:29:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 8131 transitions. [2022-11-02 20:29:08,178 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7591970121381886 [2022-11-02 20:29:08,178 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 8131 transitions. [2022-11-02 20:29:08,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 8131 transitions. [2022-11-02 20:29:08,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:08,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 8131 transitions. [2022-11-02 20:29:08,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 159.4313725490196) internal successors, (8131), 51 states have internal predecessors, (8131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:08,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 210.0) internal successors, (10920), 52 states have internal predecessors, (10920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:08,379 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 210.0) internal successors, (10920), 52 states have internal predecessors, (10920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:08,379 INFO L175 Difference]: Start difference. First operand has 505 places, 332 transitions, 2813 flow. Second operand 51 states and 8131 transitions. [2022-11-02 20:29:08,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 511 transitions, 8207 flow [2022-11-02 20:29:09,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 511 transitions, 7357 flow, removed 425 selfloop flow, removed 26 redundant places. [2022-11-02 20:29:09,178 INFO L231 Difference]: Finished difference. Result has 546 places, 351 transitions, 3088 flow [2022-11-02 20:29:09,179 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2533, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=3088, PETRI_PLACES=546, PETRI_TRANSITIONS=351} [2022-11-02 20:29:09,179 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 359 predicate places. [2022-11-02 20:29:09,179 INFO L495 AbstractCegarLoop]: Abstraction has has 546 places, 351 transitions, 3088 flow [2022-11-02 20:29:09,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:09,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:09,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:09,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-02 20:29:09,181 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:09,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:09,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1540503710, now seen corresponding path program 6 times [2022-11-02 20:29:09,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:09,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328570682] [2022-11-02 20:29:09,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:09,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:09,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:09,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328570682] [2022-11-02 20:29:09,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328570682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:09,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:09,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:09,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49534479] [2022-11-02 20:29:09,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:09,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:09,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:09,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:09,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:09,543 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:09,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 351 transitions, 3088 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:09,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:09,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:09,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:12,982 INFO L130 PetriNetUnfolder]: 950/3232 cut-off events. [2022-11-02 20:29:12,982 INFO L131 PetriNetUnfolder]: For 169734/169847 co-relation queries the response was YES. [2022-11-02 20:29:13,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29336 conditions, 3232 events. 950/3232 cut-off events. For 169734/169847 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 26439 event pairs, 501 based on Foata normal form. 15/3180 useless extension candidates. Maximal degree in co-relation 29096. Up to 1269 conditions per place. [2022-11-02 20:29:13,064 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 377 selfloop transitions, 48 changer transitions 110/693 dead transitions. [2022-11-02 20:29:13,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 693 transitions, 10862 flow [2022-11-02 20:29:13,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-02 20:29:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-11-02 20:29:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 9227 transitions. [2022-11-02 20:29:13,074 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7575533661740558 [2022-11-02 20:29:13,074 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 9227 transitions. [2022-11-02 20:29:13,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 9227 transitions. [2022-11-02 20:29:13,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:13,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 9227 transitions. [2022-11-02 20:29:13,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 159.08620689655172) internal successors, (9227), 58 states have internal predecessors, (9227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:13,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 210.0) internal successors, (12390), 59 states have internal predecessors, (12390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:13,096 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 210.0) internal successors, (12390), 59 states have internal predecessors, (12390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:13,096 INFO L175 Difference]: Start difference. First operand has 546 places, 351 transitions, 3088 flow. Second operand 58 states and 9227 transitions. [2022-11-02 20:29:13,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 693 transitions, 10862 flow [2022-11-02 20:29:13,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 693 transitions, 9730 flow, removed 545 selfloop flow, removed 38 redundant places. [2022-11-02 20:29:13,982 INFO L231 Difference]: Finished difference. Result has 580 places, 358 transitions, 3432 flow [2022-11-02 20:29:13,982 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2907, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=3432, PETRI_PLACES=580, PETRI_TRANSITIONS=358} [2022-11-02 20:29:13,982 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 393 predicate places. [2022-11-02 20:29:13,983 INFO L495 AbstractCegarLoop]: Abstraction has has 580 places, 358 transitions, 3432 flow [2022-11-02 20:29:13,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:13,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:13,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:13,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-02 20:29:13,984 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1420550416, now seen corresponding path program 3 times [2022-11-02 20:29:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:13,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659485532] [2022-11-02 20:29:13,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:13,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:14,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:14,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659485532] [2022-11-02 20:29:14,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659485532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:14,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:14,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:14,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307443099] [2022-11-02 20:29:14,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:14,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:14,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:14,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:14,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:14,300 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:14,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 358 transitions, 3432 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:14,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:14,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:14,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:17,978 INFO L130 PetriNetUnfolder]: 1031/3556 cut-off events. [2022-11-02 20:29:17,979 INFO L131 PetriNetUnfolder]: For 174075/174173 co-relation queries the response was YES. [2022-11-02 20:29:18,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31457 conditions, 3556 events. 1031/3556 cut-off events. For 174075/174173 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 29608 event pairs, 604 based on Foata normal form. 6/3493 useless extension candidates. Maximal degree in co-relation 31200. Up to 1526 conditions per place. [2022-11-02 20:29:18,108 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 277 selfloop transitions, 28 changer transitions 92/551 dead transitions. [2022-11-02 20:29:18,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 551 transitions, 9039 flow [2022-11-02 20:29:18,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-02 20:29:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-11-02 20:29:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 8139 transitions. [2022-11-02 20:29:18,117 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7599439775910364 [2022-11-02 20:29:18,117 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 8139 transitions. [2022-11-02 20:29:18,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 8139 transitions. [2022-11-02 20:29:18,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:18,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 8139 transitions. [2022-11-02 20:29:18,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 159.58823529411765) internal successors, (8139), 51 states have internal predecessors, (8139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:18,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 210.0) internal successors, (10920), 52 states have internal predecessors, (10920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:18,140 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 210.0) internal successors, (10920), 52 states have internal predecessors, (10920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:18,141 INFO L175 Difference]: Start difference. First operand has 580 places, 358 transitions, 3432 flow. Second operand 51 states and 8139 transitions. [2022-11-02 20:29:18,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 551 transitions, 9039 flow [2022-11-02 20:29:19,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 551 transitions, 8597 flow, removed 219 selfloop flow, removed 25 redundant places. [2022-11-02 20:29:19,589 INFO L231 Difference]: Finished difference. Result has 605 places, 378 transitions, 3785 flow [2022-11-02 20:29:19,590 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=3210, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=3785, PETRI_PLACES=605, PETRI_TRANSITIONS=378} [2022-11-02 20:29:19,591 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 418 predicate places. [2022-11-02 20:29:19,591 INFO L495 AbstractCegarLoop]: Abstraction has has 605 places, 378 transitions, 3785 flow [2022-11-02 20:29:19,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:19,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:19,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:19,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-02 20:29:19,593 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:19,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:19,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1365528966, now seen corresponding path program 7 times [2022-11-02 20:29:19,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:19,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151018345] [2022-11-02 20:29:19,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:19,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:20,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:20,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151018345] [2022-11-02 20:29:20,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151018345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:20,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:20,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658779572] [2022-11-02 20:29:20,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:20,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:20,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:20,463 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:20,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 378 transitions, 3785 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:20,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:20,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:20,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:24,089 INFO L130 PetriNetUnfolder]: 1052/3557 cut-off events. [2022-11-02 20:29:24,089 INFO L131 PetriNetUnfolder]: For 189602/189721 co-relation queries the response was YES. [2022-11-02 20:29:24,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32413 conditions, 3557 events. 1052/3557 cut-off events. For 189602/189721 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 29702 event pairs, 619 based on Foata normal form. 21/3500 useless extension candidates. Maximal degree in co-relation 32133. Up to 1573 conditions per place. [2022-11-02 20:29:24,478 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 265 selfloop transitions, 40 changer transitions 85/550 dead transitions. [2022-11-02 20:29:24,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 550 transitions, 7960 flow [2022-11-02 20:29:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-02 20:29:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-11-02 20:29:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 8285 transitions. [2022-11-02 20:29:24,487 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7586996336996337 [2022-11-02 20:29:24,487 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 8285 transitions. [2022-11-02 20:29:24,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 8285 transitions. [2022-11-02 20:29:24,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:24,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 8285 transitions. [2022-11-02 20:29:24,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 159.32692307692307) internal successors, (8285), 52 states have internal predecessors, (8285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:24,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 210.0) internal successors, (11130), 53 states have internal predecessors, (11130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:24,512 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 210.0) internal successors, (11130), 53 states have internal predecessors, (11130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:24,512 INFO L175 Difference]: Start difference. First operand has 605 places, 378 transitions, 3785 flow. Second operand 52 states and 8285 transitions. [2022-11-02 20:29:24,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 550 transitions, 7960 flow [2022-11-02 20:29:25,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 550 transitions, 7662 flow, removed 149 selfloop flow, removed 59 redundant places. [2022-11-02 20:29:25,895 INFO L231 Difference]: Finished difference. Result has 604 places, 394 transitions, 4052 flow [2022-11-02 20:29:25,896 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=3487, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=4052, PETRI_PLACES=604, PETRI_TRANSITIONS=394} [2022-11-02 20:29:25,896 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 417 predicate places. [2022-11-02 20:29:25,896 INFO L495 AbstractCegarLoop]: Abstraction has has 604 places, 394 transitions, 4052 flow [2022-11-02 20:29:25,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:25,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:25,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:25,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-02 20:29:25,898 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:25,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:25,898 INFO L85 PathProgramCache]: Analyzing trace with hash -32771382, now seen corresponding path program 8 times [2022-11-02 20:29:25,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:25,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562201622] [2022-11-02 20:29:25,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:25,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:26,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562201622] [2022-11-02 20:29:26,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562201622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:26,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:26,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466561658] [2022-11-02 20:29:26,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:26,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:26,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:26,216 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:26,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 394 transitions, 4052 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:26,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:26,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:26,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:29,446 INFO L130 PetriNetUnfolder]: 1031/3495 cut-off events. [2022-11-02 20:29:29,446 INFO L131 PetriNetUnfolder]: For 128240/128371 co-relation queries the response was YES. [2022-11-02 20:29:29,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29197 conditions, 3495 events. 1031/3495 cut-off events. For 128240/128371 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 29102 event pairs, 594 based on Foata normal form. 29/3443 useless extension candidates. Maximal degree in co-relation 28929. Up to 1601 conditions per place. [2022-11-02 20:29:29,935 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 239 selfloop transitions, 63 changer transitions 57/519 dead transitions. [2022-11-02 20:29:29,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 519 transitions, 7706 flow [2022-11-02 20:29:29,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-02 20:29:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-11-02 20:29:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 5439 transitions. [2022-11-02 20:29:29,941 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7617647058823529 [2022-11-02 20:29:29,941 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 5439 transitions. [2022-11-02 20:29:29,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 5439 transitions. [2022-11-02 20:29:29,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:29,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 5439 transitions. [2022-11-02 20:29:29,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 159.97058823529412) internal successors, (5439), 34 states have internal predecessors, (5439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:29,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 210.0) internal successors, (7350), 35 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:29,953 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 210.0) internal successors, (7350), 35 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:29,953 INFO L175 Difference]: Start difference. First operand has 604 places, 394 transitions, 4052 flow. Second operand 34 states and 5439 transitions. [2022-11-02 20:29:29,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 519 transitions, 7706 flow [2022-11-02 20:29:31,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 519 transitions, 7052 flow, removed 322 selfloop flow, removed 38 redundant places. [2022-11-02 20:29:31,106 INFO L231 Difference]: Finished difference. Result has 584 places, 416 transitions, 4630 flow [2022-11-02 20:29:31,107 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=3880, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=4630, PETRI_PLACES=584, PETRI_TRANSITIONS=416} [2022-11-02 20:29:31,107 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 397 predicate places. [2022-11-02 20:29:31,108 INFO L495 AbstractCegarLoop]: Abstraction has has 584 places, 416 transitions, 4630 flow [2022-11-02 20:29:31,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:31,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:31,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:31,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-02 20:29:31,109 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:31,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:31,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2102525646, now seen corresponding path program 4 times [2022-11-02 20:29:31,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:31,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63510802] [2022-11-02 20:29:31,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:31,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:31,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:31,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63510802] [2022-11-02 20:29:31,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63510802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:31,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:31,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:31,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106342497] [2022-11-02 20:29:31,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:31,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:31,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:31,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:31,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:31,387 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:31,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 416 transitions, 4630 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:31,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:31,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:31,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:34,171 INFO L130 PetriNetUnfolder]: 991/3431 cut-off events. [2022-11-02 20:29:34,171 INFO L131 PetriNetUnfolder]: For 115133/115265 co-relation queries the response was YES. [2022-11-02 20:29:34,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27381 conditions, 3431 events. 991/3431 cut-off events. For 115133/115265 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 28534 event pairs, 182 based on Foata normal form. 13/3385 useless extension candidates. Maximal degree in co-relation 27125. Up to 911 conditions per place. [2022-11-02 20:29:34,283 INFO L137 encePairwiseOnDemand]: 187/210 looper letters, 222 selfloop transitions, 29 changer transitions 244/647 dead transitions. [2022-11-02 20:29:34,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 647 transitions, 9389 flow [2022-11-02 20:29:34,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 20:29:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-02 20:29:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4816 transitions. [2022-11-02 20:29:34,286 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7644444444444445 [2022-11-02 20:29:34,286 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4816 transitions. [2022-11-02 20:29:34,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4816 transitions. [2022-11-02 20:29:34,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:34,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4816 transitions. [2022-11-02 20:29:34,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 160.53333333333333) internal successors, (4816), 30 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:34,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 210.0) internal successors, (6510), 31 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:34,296 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 210.0) internal successors, (6510), 31 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:34,296 INFO L175 Difference]: Start difference. First operand has 584 places, 416 transitions, 4630 flow. Second operand 30 states and 4816 transitions. [2022-11-02 20:29:34,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 647 transitions, 9389 flow [2022-11-02 20:29:35,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 647 transitions, 8814 flow, removed 236 selfloop flow, removed 23 redundant places. [2022-11-02 20:29:35,305 INFO L231 Difference]: Finished difference. Result has 594 places, 353 transitions, 3741 flow [2022-11-02 20:29:35,306 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=4182, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3741, PETRI_PLACES=594, PETRI_TRANSITIONS=353} [2022-11-02 20:29:35,306 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 407 predicate places. [2022-11-02 20:29:35,306 INFO L495 AbstractCegarLoop]: Abstraction has has 594 places, 353 transitions, 3741 flow [2022-11-02 20:29:35,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:35,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:35,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:35,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-02 20:29:35,307 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:35,308 INFO L85 PathProgramCache]: Analyzing trace with hash -2012157988, now seen corresponding path program 3 times [2022-11-02 20:29:35,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:35,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351868400] [2022-11-02 20:29:35,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:35,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:35,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:35,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351868400] [2022-11-02 20:29:35,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351868400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:35,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:35,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:35,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615222071] [2022-11-02 20:29:35,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:35,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:35,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:35,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:35,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:35,678 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:35,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 353 transitions, 3741 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:35,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:35,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:35,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:38,158 INFO L130 PetriNetUnfolder]: 807/2909 cut-off events. [2022-11-02 20:29:38,158 INFO L131 PetriNetUnfolder]: For 106367/106401 co-relation queries the response was YES. [2022-11-02 20:29:38,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23208 conditions, 2909 events. 807/2909 cut-off events. For 106367/106401 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 23144 event pairs, 454 based on Foata normal form. 6/2859 useless extension candidates. Maximal degree in co-relation 22947. Up to 1115 conditions per place. [2022-11-02 20:29:38,234 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 224 selfloop transitions, 35 changer transitions 52/502 dead transitions. [2022-11-02 20:29:38,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 502 transitions, 7592 flow [2022-11-02 20:29:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 20:29:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-02 20:29:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4830 transitions. [2022-11-02 20:29:38,238 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2022-11-02 20:29:38,239 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4830 transitions. [2022-11-02 20:29:38,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4830 transitions. [2022-11-02 20:29:38,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:38,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4830 transitions. [2022-11-02 20:29:38,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 161.0) internal successors, (4830), 30 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:38,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 210.0) internal successors, (6510), 31 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:38,248 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 210.0) internal successors, (6510), 31 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:38,248 INFO L175 Difference]: Start difference. First operand has 594 places, 353 transitions, 3741 flow. Second operand 30 states and 4830 transitions. [2022-11-02 20:29:38,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 502 transitions, 7592 flow [2022-11-02 20:29:39,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 502 transitions, 6994 flow, removed 256 selfloop flow, removed 53 redundant places. [2022-11-02 20:29:39,357 INFO L231 Difference]: Finished difference. Result has 543 places, 385 transitions, 4293 flow [2022-11-02 20:29:39,357 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=3414, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=4293, PETRI_PLACES=543, PETRI_TRANSITIONS=385} [2022-11-02 20:29:39,358 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 356 predicate places. [2022-11-02 20:29:39,358 INFO L495 AbstractCegarLoop]: Abstraction has has 543 places, 385 transitions, 4293 flow [2022-11-02 20:29:39,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:39,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:39,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:39,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-02 20:29:39,360 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:39,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash 881964842, now seen corresponding path program 4 times [2022-11-02 20:29:39,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:39,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446170070] [2022-11-02 20:29:39,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:39,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:39,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:39,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446170070] [2022-11-02 20:29:39,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446170070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:39,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:39,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:39,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365252385] [2022-11-02 20:29:39,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:39,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:39,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:39,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:39,707 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:39,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 385 transitions, 4293 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:39,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:39,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:39,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:42,200 INFO L130 PetriNetUnfolder]: 817/2919 cut-off events. [2022-11-02 20:29:42,200 INFO L131 PetriNetUnfolder]: For 111089/111131 co-relation queries the response was YES. [2022-11-02 20:29:42,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23706 conditions, 2919 events. 817/2919 cut-off events. For 111089/111131 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 23211 event pairs, 411 based on Foata normal form. 8/2876 useless extension candidates. Maximal degree in co-relation 23467. Up to 1183 conditions per place. [2022-11-02 20:29:42,308 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 218 selfloop transitions, 50 changer transitions 44/503 dead transitions. [2022-11-02 20:29:42,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 503 transitions, 7657 flow [2022-11-02 20:29:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:29:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-02 20:29:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4180 transitions. [2022-11-02 20:29:42,314 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7655677655677655 [2022-11-02 20:29:42,314 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4180 transitions. [2022-11-02 20:29:42,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4180 transitions. [2022-11-02 20:29:42,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:42,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4180 transitions. [2022-11-02 20:29:42,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 160.76923076923077) internal successors, (4180), 26 states have internal predecessors, (4180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:42,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 210.0) internal successors, (5670), 27 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:42,327 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 210.0) internal successors, (5670), 27 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:42,327 INFO L175 Difference]: Start difference. First operand has 543 places, 385 transitions, 4293 flow. Second operand 26 states and 4180 transitions. [2022-11-02 20:29:42,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 503 transitions, 7657 flow [2022-11-02 20:29:43,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 503 transitions, 6963 flow, removed 347 selfloop flow, removed 12 redundant places. [2022-11-02 20:29:43,182 INFO L231 Difference]: Finished difference. Result has 558 places, 403 transitions, 4543 flow [2022-11-02 20:29:43,182 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=3841, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4543, PETRI_PLACES=558, PETRI_TRANSITIONS=403} [2022-11-02 20:29:43,182 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 371 predicate places. [2022-11-02 20:29:43,183 INFO L495 AbstractCegarLoop]: Abstraction has has 558 places, 403 transitions, 4543 flow [2022-11-02 20:29:43,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:43,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:43,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:43,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-02 20:29:43,184 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:43,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash -598085826, now seen corresponding path program 5 times [2022-11-02 20:29:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:43,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120712663] [2022-11-02 20:29:43,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:43,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:43,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:43,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120712663] [2022-11-02 20:29:43,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120712663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:43,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:43,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979212156] [2022-11-02 20:29:43,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:43,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:43,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:43,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:43,598 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:43,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 403 transitions, 4543 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:43,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:43,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:43,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:47,099 INFO L130 PetriNetUnfolder]: 962/3285 cut-off events. [2022-11-02 20:29:47,100 INFO L131 PetriNetUnfolder]: For 129691/129738 co-relation queries the response was YES. [2022-11-02 20:29:47,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27911 conditions, 3285 events. 962/3285 cut-off events. For 129691/129738 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 26709 event pairs, 501 based on Foata normal form. 10/3242 useless extension candidates. Maximal degree in co-relation 27666. Up to 1185 conditions per place. [2022-11-02 20:29:47,210 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 276 selfloop transitions, 36 changer transitions 88/591 dead transitions. [2022-11-02 20:29:47,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 591 transitions, 10210 flow [2022-11-02 20:29:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-02 20:29:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-11-02 20:29:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 8287 transitions. [2022-11-02 20:29:47,217 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7588827838827839 [2022-11-02 20:29:47,217 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 8287 transitions. [2022-11-02 20:29:47,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 8287 transitions. [2022-11-02 20:29:47,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:47,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 8287 transitions. [2022-11-02 20:29:47,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 159.3653846153846) internal successors, (8287), 52 states have internal predecessors, (8287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:47,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 210.0) internal successors, (11130), 53 states have internal predecessors, (11130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:47,233 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 210.0) internal successors, (11130), 53 states have internal predecessors, (11130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:47,233 INFO L175 Difference]: Start difference. First operand has 558 places, 403 transitions, 4543 flow. Second operand 52 states and 8287 transitions. [2022-11-02 20:29:47,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 591 transitions, 10210 flow [2022-11-02 20:29:48,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 591 transitions, 9514 flow, removed 279 selfloop flow, removed 12 redundant places. [2022-11-02 20:29:48,230 INFO L231 Difference]: Finished difference. Result has 630 places, 423 transitions, 4592 flow [2022-11-02 20:29:48,231 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=4047, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=4592, PETRI_PLACES=630, PETRI_TRANSITIONS=423} [2022-11-02 20:29:48,231 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 443 predicate places. [2022-11-02 20:29:48,231 INFO L495 AbstractCegarLoop]: Abstraction has has 630 places, 423 transitions, 4592 flow [2022-11-02 20:29:48,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:48,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:48,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:48,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-02 20:29:48,232 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:48,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:48,232 INFO L85 PathProgramCache]: Analyzing trace with hash -746535632, now seen corresponding path program 6 times [2022-11-02 20:29:48,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:48,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415509822] [2022-11-02 20:29:48,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:48,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:48,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:48,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415509822] [2022-11-02 20:29:48,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415509822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:48,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:48,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:48,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432491782] [2022-11-02 20:29:48,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:48,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:48,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:48,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:48,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:48,535 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:48,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 423 transitions, 4592 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:48,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:48,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:48,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:52,322 INFO L130 PetriNetUnfolder]: 982/3356 cut-off events. [2022-11-02 20:29:52,322 INFO L131 PetriNetUnfolder]: For 182853/182917 co-relation queries the response was YES. [2022-11-02 20:29:52,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31294 conditions, 3356 events. 982/3356 cut-off events. For 182853/182917 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 27408 event pairs, 571 based on Foata normal form. 14/3315 useless extension candidates. Maximal degree in co-relation 31013. Up to 1222 conditions per place. [2022-11-02 20:29:52,419 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 282 selfloop transitions, 39 changer transitions 88/600 dead transitions. [2022-11-02 20:29:52,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 600 transitions, 11274 flow [2022-11-02 20:29:52,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-02 20:29:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-11-02 20:29:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 8133 transitions. [2022-11-02 20:29:52,424 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7593837535014005 [2022-11-02 20:29:52,424 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 8133 transitions. [2022-11-02 20:29:52,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 8133 transitions. [2022-11-02 20:29:52,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:52,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 8133 transitions. [2022-11-02 20:29:52,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 159.47058823529412) internal successors, (8133), 51 states have internal predecessors, (8133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:52,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 210.0) internal successors, (10920), 52 states have internal predecessors, (10920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:52,442 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 210.0) internal successors, (10920), 52 states have internal predecessors, (10920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:52,442 INFO L175 Difference]: Start difference. First operand has 630 places, 423 transitions, 4592 flow. Second operand 51 states and 8133 transitions. [2022-11-02 20:29:52,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 600 transitions, 11274 flow [2022-11-02 20:29:53,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 600 transitions, 9986 flow, removed 644 selfloop flow, removed 35 redundant places. [2022-11-02 20:29:53,639 INFO L231 Difference]: Finished difference. Result has 652 places, 440 transitions, 5030 flow [2022-11-02 20:29:53,640 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=4456, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=5030, PETRI_PLACES=652, PETRI_TRANSITIONS=440} [2022-11-02 20:29:53,641 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 465 predicate places. [2022-11-02 20:29:53,641 INFO L495 AbstractCegarLoop]: Abstraction has has 652 places, 440 transitions, 5030 flow [2022-11-02 20:29:53,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:53,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:53,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:53,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-11-02 20:29:53,643 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:53,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash 450373676, now seen corresponding path program 7 times [2022-11-02 20:29:53,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:53,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849104435] [2022-11-02 20:29:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:53,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:53,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:53,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849104435] [2022-11-02 20:29:53,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849104435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:53,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:53,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:53,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016587425] [2022-11-02 20:29:53,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:53,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:53,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:53,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:53,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:53,954 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:53,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 440 transitions, 5030 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:53,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:53,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:53,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:57,525 INFO L130 PetriNetUnfolder]: 973/3341 cut-off events. [2022-11-02 20:29:57,526 INFO L131 PetriNetUnfolder]: For 180831/180908 co-relation queries the response was YES. [2022-11-02 20:29:57,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31066 conditions, 3341 events. 973/3341 cut-off events. For 180831/180908 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 27617 event pairs, 426 based on Foata normal form. 7/3295 useless extension candidates. Maximal degree in co-relation 30772. Up to 1069 conditions per place. [2022-11-02 20:29:57,921 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 448 selfloop transitions, 62 changer transitions 114/815 dead transitions. [2022-11-02 20:29:57,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 815 transitions, 14523 flow [2022-11-02 20:29:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-02 20:29:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-11-02 20:29:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 9230 transitions. [2022-11-02 20:29:57,928 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7577996715927751 [2022-11-02 20:29:57,928 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 9230 transitions. [2022-11-02 20:29:57,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 9230 transitions. [2022-11-02 20:29:57,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:57,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 9230 transitions. [2022-11-02 20:29:57,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 159.13793103448276) internal successors, (9230), 58 states have internal predecessors, (9230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:57,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 210.0) internal successors, (12390), 59 states have internal predecessors, (12390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:57,945 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 210.0) internal successors, (12390), 59 states have internal predecessors, (12390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:57,945 INFO L175 Difference]: Start difference. First operand has 652 places, 440 transitions, 5030 flow. Second operand 58 states and 9230 transitions. [2022-11-02 20:29:57,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 815 transitions, 14523 flow [2022-11-02 20:29:59,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 815 transitions, 13398 flow, removed 538 selfloop flow, removed 38 redundant places. [2022-11-02 20:29:59,572 INFO L231 Difference]: Finished difference. Result has 685 places, 446 transitions, 5431 flow [2022-11-02 20:29:59,573 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=4845, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=5431, PETRI_PLACES=685, PETRI_TRANSITIONS=446} [2022-11-02 20:29:59,573 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 498 predicate places. [2022-11-02 20:29:59,574 INFO L495 AbstractCegarLoop]: Abstraction has has 685 places, 446 transitions, 5431 flow [2022-11-02 20:29:59,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:59,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:59,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:59,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-02 20:29:59,575 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:29:59,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1761307050, now seen corresponding path program 8 times [2022-11-02 20:29:59,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:59,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367447559] [2022-11-02 20:29:59,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:59,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:59,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:59,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367447559] [2022-11-02 20:29:59,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367447559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:59,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:59,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:29:59,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220908416] [2022-11-02 20:29:59,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:59,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:29:59,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:59,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:29:59,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:59,837 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:29:59,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 446 transitions, 5431 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:59,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:59,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:29:59,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:03,257 INFO L130 PetriNetUnfolder]: 1018/3506 cut-off events. [2022-11-02 20:30:03,257 INFO L131 PetriNetUnfolder]: For 166644/166726 co-relation queries the response was YES. [2022-11-02 20:30:03,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31881 conditions, 3506 events. 1018/3506 cut-off events. For 166644/166726 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 29319 event pairs, 458 based on Foata normal form. 26/3476 useless extension candidates. Maximal degree in co-relation 31571. Up to 1260 conditions per place. [2022-11-02 20:30:03,367 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 273 selfloop transitions, 64 changer transitions 89/617 dead transitions. [2022-11-02 20:30:03,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 617 transitions, 10830 flow [2022-11-02 20:30:03,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-02 20:30:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2022-11-02 20:30:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 8589 transitions. [2022-11-02 20:30:03,373 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7574074074074074 [2022-11-02 20:30:03,373 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 8589 transitions. [2022-11-02 20:30:03,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 8589 transitions. [2022-11-02 20:30:03,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:03,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 8589 transitions. [2022-11-02 20:30:03,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 159.05555555555554) internal successors, (8589), 54 states have internal predecessors, (8589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:03,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 210.0) internal successors, (11550), 55 states have internal predecessors, (11550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:03,388 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 210.0) internal successors, (11550), 55 states have internal predecessors, (11550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:03,388 INFO L175 Difference]: Start difference. First operand has 685 places, 446 transitions, 5431 flow. Second operand 54 states and 8589 transitions. [2022-11-02 20:30:03,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 617 transitions, 10830 flow [2022-11-02 20:30:04,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 617 transitions, 9504 flow, removed 618 selfloop flow, removed 37 redundant places. [2022-11-02 20:30:04,918 INFO L231 Difference]: Finished difference. Result has 697 places, 453 transitions, 5598 flow [2022-11-02 20:30:04,919 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=5187, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=5598, PETRI_PLACES=697, PETRI_TRANSITIONS=453} [2022-11-02 20:30:04,919 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 510 predicate places. [2022-11-02 20:30:04,919 INFO L495 AbstractCegarLoop]: Abstraction has has 697 places, 453 transitions, 5598 flow [2022-11-02 20:30:04,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:04,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:04,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:04,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-02 20:30:04,920 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:30:04,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:04,921 INFO L85 PathProgramCache]: Analyzing trace with hash -724380744, now seen corresponding path program 9 times [2022-11-02 20:30:04,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:04,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517668616] [2022-11-02 20:30:04,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:04,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:05,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:05,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517668616] [2022-11-02 20:30:05,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517668616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:05,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:05,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:30:05,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082171197] [2022-11-02 20:30:05,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:05,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:30:05,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:05,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:30:05,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:30:05,185 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:30:05,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 453 transitions, 5598 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:05,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:05,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:30:05,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:09,101 INFO L130 PetriNetUnfolder]: 1029/3544 cut-off events. [2022-11-02 20:30:09,101 INFO L131 PetriNetUnfolder]: For 139139/139219 co-relation queries the response was YES. [2022-11-02 20:30:09,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31049 conditions, 3544 events. 1029/3544 cut-off events. For 139139/139219 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 29737 event pairs, 495 based on Foata normal form. 22/3508 useless extension candidates. Maximal degree in co-relation 30731. Up to 1287 conditions per place. [2022-11-02 20:30:09,198 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 302 selfloop transitions, 52 changer transitions 88/633 dead transitions. [2022-11-02 20:30:09,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 633 transitions, 11540 flow [2022-11-02 20:30:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-02 20:30:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-11-02 20:30:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 8441 transitions. [2022-11-02 20:30:09,204 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7584007187780772 [2022-11-02 20:30:09,205 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 8441 transitions. [2022-11-02 20:30:09,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 8441 transitions. [2022-11-02 20:30:09,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:09,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 8441 transitions. [2022-11-02 20:30:09,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 159.26415094339623) internal successors, (8441), 53 states have internal predecessors, (8441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:09,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 210.0) internal successors, (11340), 54 states have internal predecessors, (11340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:09,220 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 210.0) internal successors, (11340), 54 states have internal predecessors, (11340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:09,220 INFO L175 Difference]: Start difference. First operand has 697 places, 453 transitions, 5598 flow. Second operand 53 states and 8441 transitions. [2022-11-02 20:30:09,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 633 transitions, 11540 flow [2022-11-02 20:30:10,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 633 transitions, 10526 flow, removed 484 selfloop flow, removed 49 redundant places. [2022-11-02 20:30:10,427 INFO L231 Difference]: Finished difference. Result has 702 places, 466 transitions, 6013 flow [2022-11-02 20:30:10,428 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=5438, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=6013, PETRI_PLACES=702, PETRI_TRANSITIONS=466} [2022-11-02 20:30:10,428 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 515 predicate places. [2022-11-02 20:30:10,428 INFO L495 AbstractCegarLoop]: Abstraction has has 702 places, 466 transitions, 6013 flow [2022-11-02 20:30:10,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:10,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:10,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:10,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-02 20:30:10,429 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:30:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash 808342620, now seen corresponding path program 10 times [2022-11-02 20:30:10,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:10,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634955222] [2022-11-02 20:30:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:10,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:10,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634955222] [2022-11-02 20:30:10,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634955222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:10,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:10,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:30:10,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185307073] [2022-11-02 20:30:10,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:10,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:30:10,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:10,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:30:10,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:30:10,669 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:30:10,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 466 transitions, 6013 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:10,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:10,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:30:10,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:14,308 INFO L130 PetriNetUnfolder]: 1012/3504 cut-off events. [2022-11-02 20:30:14,308 INFO L131 PetriNetUnfolder]: For 142022/142121 co-relation queries the response was YES. [2022-11-02 20:30:14,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31178 conditions, 3504 events. 1012/3504 cut-off events. For 142022/142121 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 29394 event pairs, 529 based on Foata normal form. 19/3459 useless extension candidates. Maximal degree in co-relation 30863. Up to 1322 conditions per place. [2022-11-02 20:30:14,441 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 311 selfloop transitions, 74 changer transitions 79/655 dead transitions. [2022-11-02 20:30:14,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 655 transitions, 12171 flow [2022-11-02 20:30:14,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-02 20:30:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-11-02 20:30:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 6702 transitions. [2022-11-02 20:30:14,447 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7598639455782313 [2022-11-02 20:30:14,447 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 6702 transitions. [2022-11-02 20:30:14,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 6702 transitions. [2022-11-02 20:30:14,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:14,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 6702 transitions. [2022-11-02 20:30:14,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 159.57142857142858) internal successors, (6702), 42 states have internal predecessors, (6702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:14,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 210.0) internal successors, (9030), 43 states have internal predecessors, (9030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:14,468 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 210.0) internal successors, (9030), 43 states have internal predecessors, (9030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:14,468 INFO L175 Difference]: Start difference. First operand has 702 places, 466 transitions, 6013 flow. Second operand 42 states and 6702 transitions. [2022-11-02 20:30:14,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 655 transitions, 12171 flow [2022-11-02 20:30:16,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 655 transitions, 11401 flow, removed 378 selfloop flow, removed 37 redundant places. [2022-11-02 20:30:16,025 INFO L231 Difference]: Finished difference. Result has 700 places, 492 transitions, 6980 flow [2022-11-02 20:30:16,025 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=5841, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=6980, PETRI_PLACES=700, PETRI_TRANSITIONS=492} [2022-11-02 20:30:16,026 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 513 predicate places. [2022-11-02 20:30:16,026 INFO L495 AbstractCegarLoop]: Abstraction has has 700 places, 492 transitions, 6980 flow [2022-11-02 20:30:16,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:16,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:16,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:16,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-11-02 20:30:16,028 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:30:16,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:16,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1898522158, now seen corresponding path program 11 times [2022-11-02 20:30:16,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:16,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856887610] [2022-11-02 20:30:16,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:16,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:16,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856887610] [2022-11-02 20:30:16,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856887610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:16,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:16,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:30:16,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552369671] [2022-11-02 20:30:16,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:16,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:30:16,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:16,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:30:16,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:30:16,276 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:30:16,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 492 transitions, 6980 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:16,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:16,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:30:16,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:20,063 INFO L130 PetriNetUnfolder]: 1008/3549 cut-off events. [2022-11-02 20:30:20,063 INFO L131 PetriNetUnfolder]: For 135017/135114 co-relation queries the response was YES. [2022-11-02 20:30:20,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30874 conditions, 3549 events. 1008/3549 cut-off events. For 135017/135114 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 30053 event pairs, 571 based on Foata normal form. 12/3495 useless extension candidates. Maximal degree in co-relation 30560. Up to 1319 conditions per place. [2022-11-02 20:30:20,169 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 358 selfloop transitions, 87 changer transitions 94/730 dead transitions. [2022-11-02 20:30:20,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 730 transitions, 14464 flow [2022-11-02 20:30:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-02 20:30:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-11-02 20:30:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 7963 transitions. [2022-11-02 20:30:20,175 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7583809523809524 [2022-11-02 20:30:20,175 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 7963 transitions. [2022-11-02 20:30:20,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 7963 transitions. [2022-11-02 20:30:20,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:20,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 7963 transitions. [2022-11-02 20:30:20,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 159.26) internal successors, (7963), 50 states have internal predecessors, (7963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:20,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 210.0) internal successors, (10710), 51 states have internal predecessors, (10710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:20,191 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 210.0) internal successors, (10710), 51 states have internal predecessors, (10710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:20,191 INFO L175 Difference]: Start difference. First operand has 700 places, 492 transitions, 6980 flow. Second operand 50 states and 7963 transitions. [2022-11-02 20:30:20,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 730 transitions, 14464 flow [2022-11-02 20:30:21,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 730 transitions, 13195 flow, removed 516 selfloop flow, removed 30 redundant places. [2022-11-02 20:30:21,878 INFO L231 Difference]: Finished difference. Result has 735 places, 524 transitions, 7583 flow [2022-11-02 20:30:21,878 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=6311, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=7583, PETRI_PLACES=735, PETRI_TRANSITIONS=524} [2022-11-02 20:30:21,879 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 548 predicate places. [2022-11-02 20:30:21,879 INFO L495 AbstractCegarLoop]: Abstraction has has 735 places, 524 transitions, 7583 flow [2022-11-02 20:30:21,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:21,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:21,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:21,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-11-02 20:30:21,880 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:30:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:21,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1916739014, now seen corresponding path program 12 times [2022-11-02 20:30:21,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:21,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14403586] [2022-11-02 20:30:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:21,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:22,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:22,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14403586] [2022-11-02 20:30:22,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14403586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:22,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:22,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:30:22,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854686640] [2022-11-02 20:30:22,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:22,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:30:22,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:22,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:30:22,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:30:22,152 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:30:22,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 735 places, 524 transitions, 7583 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:22,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:22,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:30:22,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:25,854 INFO L130 PetriNetUnfolder]: 1007/3508 cut-off events. [2022-11-02 20:30:25,855 INFO L131 PetriNetUnfolder]: For 136523/136626 co-relation queries the response was YES. [2022-11-02 20:30:25,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30622 conditions, 3508 events. 1007/3508 cut-off events. For 136523/136626 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 29511 event pairs, 468 based on Foata normal form. 33/3484 useless extension candidates. Maximal degree in co-relation 30290. Up to 1291 conditions per place. [2022-11-02 20:30:25,963 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 317 selfloop transitions, 111 changer transitions 83/702 dead transitions. [2022-11-02 20:30:25,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 702 transitions, 12933 flow [2022-11-02 20:30:25,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-02 20:30:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-11-02 20:30:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 7328 transitions. [2022-11-02 20:30:25,970 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.758592132505176 [2022-11-02 20:30:25,970 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 7328 transitions. [2022-11-02 20:30:25,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 7328 transitions. [2022-11-02 20:30:25,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:25,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 7328 transitions. [2022-11-02 20:30:25,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 159.30434782608697) internal successors, (7328), 46 states have internal predecessors, (7328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:25,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 210.0) internal successors, (9870), 47 states have internal predecessors, (9870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:25,983 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 210.0) internal successors, (9870), 47 states have internal predecessors, (9870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:25,984 INFO L175 Difference]: Start difference. First operand has 735 places, 524 transitions, 7583 flow. Second operand 46 states and 7328 transitions. [2022-11-02 20:30:25,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 742 places, 702 transitions, 12933 flow [2022-11-02 20:30:27,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 702 transitions, 11786 flow, removed 495 selfloop flow, removed 38 redundant places. [2022-11-02 20:30:27,678 INFO L231 Difference]: Finished difference. Result has 736 places, 526 transitions, 7369 flow [2022-11-02 20:30:27,679 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=6952, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=7369, PETRI_PLACES=736, PETRI_TRANSITIONS=526} [2022-11-02 20:30:27,680 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 549 predicate places. [2022-11-02 20:30:27,680 INFO L495 AbstractCegarLoop]: Abstraction has has 736 places, 526 transitions, 7369 flow [2022-11-02 20:30:27,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:27,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:27,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:27,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-11-02 20:30:27,681 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:30:27,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash -232838506, now seen corresponding path program 13 times [2022-11-02 20:30:27,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:27,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330285999] [2022-11-02 20:30:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:27,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:27,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330285999] [2022-11-02 20:30:27,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330285999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:27,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:27,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:30:27,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824378345] [2022-11-02 20:30:27,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:27,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:30:27,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:27,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:30:27,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:30:27,914 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:30:27,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 526 transitions, 7369 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:27,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:27,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:30:27,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:31,554 INFO L130 PetriNetUnfolder]: 989/3485 cut-off events. [2022-11-02 20:30:31,554 INFO L131 PetriNetUnfolder]: For 121878/121976 co-relation queries the response was YES. [2022-11-02 20:30:31,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29734 conditions, 3485 events. 989/3485 cut-off events. For 121878/121976 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 29383 event pairs, 511 based on Foata normal form. 24/3448 useless extension candidates. Maximal degree in co-relation 29406. Up to 1312 conditions per place. [2022-11-02 20:30:31,686 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 305 selfloop transitions, 114 changer transitions 70/680 dead transitions. [2022-11-02 20:30:31,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 680 transitions, 12233 flow [2022-11-02 20:30:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-02 20:30:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-11-02 20:30:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 5441 transitions. [2022-11-02 20:30:31,691 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7620448179271708 [2022-11-02 20:30:31,691 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 5441 transitions. [2022-11-02 20:30:31,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 5441 transitions. [2022-11-02 20:30:31,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:31,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 5441 transitions. [2022-11-02 20:30:31,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 160.02941176470588) internal successors, (5441), 34 states have internal predecessors, (5441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:31,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 210.0) internal successors, (7350), 35 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:31,703 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 210.0) internal successors, (7350), 35 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:31,703 INFO L175 Difference]: Start difference. First operand has 736 places, 526 transitions, 7369 flow. Second operand 34 states and 5441 transitions. [2022-11-02 20:30:31,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 680 transitions, 12233 flow [2022-11-02 20:30:33,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 680 transitions, 11766 flow, removed 181 selfloop flow, removed 39 redundant places. [2022-11-02 20:30:33,221 INFO L231 Difference]: Finished difference. Result has 722 places, 544 transitions, 8034 flow [2022-11-02 20:30:33,221 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=7168, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=8034, PETRI_PLACES=722, PETRI_TRANSITIONS=544} [2022-11-02 20:30:33,222 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 535 predicate places. [2022-11-02 20:30:33,222 INFO L495 AbstractCegarLoop]: Abstraction has has 722 places, 544 transitions, 8034 flow [2022-11-02 20:30:33,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:33,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:33,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:33,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-11-02 20:30:33,223 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:30:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1270843986, now seen corresponding path program 9 times [2022-11-02 20:30:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:33,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180509999] [2022-11-02 20:30:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:33,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:33,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180509999] [2022-11-02 20:30:33,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180509999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:33,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:33,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:30:33,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134401220] [2022-11-02 20:30:33,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:33,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:30:33,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:33,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:30:33,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:30:33,454 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:30:33,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 544 transitions, 8034 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:33,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:33,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:30:33,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:37,297 INFO L130 PetriNetUnfolder]: 1004/3421 cut-off events. [2022-11-02 20:30:37,298 INFO L131 PetriNetUnfolder]: For 113024/113144 co-relation queries the response was YES. [2022-11-02 20:30:37,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29225 conditions, 3421 events. 1004/3421 cut-off events. For 113024/113144 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 28575 event pairs, 479 based on Foata normal form. 22/3375 useless extension candidates. Maximal degree in co-relation 28906. Up to 1483 conditions per place. [2022-11-02 20:30:37,392 INFO L137 encePairwiseOnDemand]: 189/210 looper letters, 340 selfloop transitions, 65 changer transitions 89/704 dead transitions. [2022-11-02 20:30:37,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 755 places, 704 transitions, 11872 flow [2022-11-02 20:30:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-02 20:30:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2022-11-02 20:30:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 8587 transitions. [2022-11-02 20:30:37,398 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7572310405643738 [2022-11-02 20:30:37,398 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 8587 transitions. [2022-11-02 20:30:37,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 8587 transitions. [2022-11-02 20:30:37,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:37,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 8587 transitions. [2022-11-02 20:30:37,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 159.0185185185185) internal successors, (8587), 54 states have internal predecessors, (8587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:37,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 210.0) internal successors, (11550), 55 states have internal predecessors, (11550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:37,413 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 210.0) internal successors, (11550), 55 states have internal predecessors, (11550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:37,414 INFO L175 Difference]: Start difference. First operand has 722 places, 544 transitions, 8034 flow. Second operand 54 states and 8587 transitions. [2022-11-02 20:30:37,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 755 places, 704 transitions, 11872 flow [2022-11-02 20:30:38,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 731 places, 704 transitions, 11359 flow, removed 150 selfloop flow, removed 24 redundant places. [2022-11-02 20:30:38,906 INFO L231 Difference]: Finished difference. Result has 772 places, 545 transitions, 7809 flow [2022-11-02 20:30:38,906 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=7521, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=7809, PETRI_PLACES=772, PETRI_TRANSITIONS=545} [2022-11-02 20:30:38,906 INFO L287 CegarLoopForPetriNet]: 187 programPoint places, 585 predicate places. [2022-11-02 20:30:38,907 INFO L495 AbstractCegarLoop]: Abstraction has has 772 places, 545 transitions, 7809 flow [2022-11-02 20:30:38,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:38,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:38,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:38,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-11-02 20:30:38,908 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-02 20:30:38,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1962951598, now seen corresponding path program 10 times [2022-11-02 20:30:38,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:38,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003222019] [2022-11-02 20:30:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:38,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:39,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:39,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003222019] [2022-11-02 20:30:39,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003222019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:39,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:39,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:30:39,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340588570] [2022-11-02 20:30:39,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:39,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:30:39,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:39,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:30:39,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:30:39,160 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2022-11-02 20:30:39,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 772 places, 545 transitions, 7809 flow. Second operand has 14 states, 14 states have (on average 157.57142857142858) internal successors, (2206), 14 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:39,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:39,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2022-11-02 20:30:39,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand